|
Search: id:A135966
|
|
|
| A135966 |
|
Triangle, read by rows, where T(n,k) = fibonacci(k(n-k) + 1) for n>=k>=0. |
|
+0
2
|
|
| 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
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
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; ...
|
|
PROGRAM
|
(PARI) T(n, k)=fibonacci(k*(n-k)+1)
|
|
CROSSREFS
|
Cf. A135967.
Sequence in context: A034327 A076835 A034254 this_sequence A060351 A076037 A076263
Adjacent sequences: A135963 A135964 A135965 this_sequence A135967 A135968 A135969
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Dec 11 2007
|
|
|
Search completed in 0.002 seconds
|
