TribonacciSequence

package Fundamentals.Methods.Exercises.MoreExercise;

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.EnumMap;
import java.util.List;
import java.util.Scanner;

public class TribonacciSequence {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);


        int num = Integer.parseInt(scanner.nextLine());

        Tribunacci(num);
    }

    public static void Tribunacci(int num) {

        if (num <= 3) {
            for (int i = 1; i <= num; i++) {
                System.out.printf("%d ", i);
            }
        } else {
            long[] bi = new long[num];
            bi[0] = 1;
            bi[1] = 1;
            bi[2] = 2;
            for (int i = 3; i < num; i++) {
                bi[i] = bi[i - 1] + bi[i - 2] + bi[i - 3];
            }
            for (long item : bi) {
                System.out.printf("%d ", item);
            }
        }
    }
}