A135966 Triangle, read by rows, where T(n,k) = fibonacci(k(n-k) + 1) for n>=k>=0.

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 5, 3, 1, 1, 5, 13, 13, 5, 1, 1, 8, 34, 55, 34, 8, 1, 1, 13, 89, 233, 233, 89, 13, 1, 1, 21, 233, 987, 1597, 987, 233, 21, 1, 1, 34, 610, 4181, 10946, 10946, 4181, 610, 34, 1, 1, 55, 1597, 17711, 75025, 121393, 75025, 17711, 1597, 55, 1

Offset

0,8

Links

Table of n, a(n) for n=0..65.

Example

Triangle begins:
1;
1, 1;
1, 1, 1;
1, 2, 2, 1;
1, 3, 5, 3, 1;
1, 5, 13, 13, 5, 1;
1, 8, 34, 55, 34, 8, 1;
1, 13, 89, 233, 233, 89, 13, 1;
1, 21, 233, 987, 1597, 987, 233, 21, 1;
1, 34, 610, 4181, 10946, 10946, 4181, 610, 34, 1;
1, 55, 1597, 17711, 75025, 121393, 75025, 17711, 1597, 55, 1; ...

Mathematica

Flatten[Table[Fibonacci[k(n-k)+1], {n, 0, 10}, {k, 0, n}]] (* Harvey P. Dale, Feb 03 2015 *)

Prog

(PARI) T(n, k)=fibonacci(k*(n-k)+1)

Crossrefs

Cf. A135967.

Sequence in context: A034327 A034254 A157103 * A292741 A356802 A060351

Adjacent sequences: A135963 A135964 A135965 * A135967 A135968 A135969

Keyword

nonn,tabl

Author

Paul D. Hanna, Dec 11 2007

Status

approved