|
Search: id:A061451
|
|
|
| A061451 |
|
Array T(n,k) of k-th order Fibonacci numbers read by antidiagonals in up-direction. |
|
+0
1
|
|
| 2, 3, 3, 4, 5, 5, 5, 7, 9, 8, 6, 9, 13, 17, 13, 7, 11, 17, 25, 31, 21, 8, 13, 21, 33, 49, 57, 34, 9, 15, 25, 41, 65, 94, 105, 55, 10, 17, 29, 49, 81, 129, 181, 193, 89, 11, 19, 33, 57, 97, 161, 253, 349, 355, 144, 12, 21, 37, 65, 113, 193, 321, 497, 673, 653, 233
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. Wirth, Algorithmen und Datenstrukturen, 1975, table 2.15 (ch. 2.3.4)
|
|
LINKS
|
T. D. Noe, Rows n=1..50 of triangle, flattened
|
|
EXAMPLE
|
2, 3, 5, 8 ... first order, a(1)=2, a(3)=3, a(6)=5, a(10)=8, ...
3, 5, 9,17 ... 2nd order, a(2)=3, a(5)=5, a(9)=9, ...
4, 7,13,25 ... 3rd order, a(4)=4, a(8)=7, ...
5, 9,17,33 ... 4th order, a(7)=5, ...
|
|
CROSSREFS
|
Rows 1..6: A000045, A000213, A000288, A000322, A000383, A060455.
Sequence in context: A073092 A088023 A133316 this_sequence A086155 A094606 A080595
Adjacent sequences: A061448 A061449 A061450 this_sequence A061452 A061453 A061454
|
|
KEYWORD
|
nonn,easy,tabl,nice
|
|
AUTHOR
|
Frank.Ellermann(AT)t-online.de, Jun 11 2001
|
|
|
Search completed in 0.005 seconds
|
