Flattened triangle read by rows such that each row has 2n+1 entries, T(n, k) = T(n, k+1) + T(n, k+2) for k < 2n-1, T(n, n) = Fibonacci(n), and T(n, n-1) = Fibonacci(n-1) for n > 0.

A152459

Flattened triangle read by rows such that each row has 2n+1 entries, T(n, k) = T(n, k+1) + T(n, k+2) for k < 2n-1, T(n, n) = Fibonacci(n), and T(n, n-1) = Fibonacci(n-1) for n > 0.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =-1a(4) =2a(5) =1a(6) =1a(7) =0a(8) =1a(9) =4a(10) =3a(11) =1a(12) =2a(13) =-1a(14) =3a(15) =-4a(16) =12a(17) =7a(18) =5a(19) =2a(20) =3a(21) =-1a(22) =4a(23) =-5a(24) =9a(25) =30a(26) =19a(27) =11a(28) =8a(29) =3

External references