|
Search: id:A060455
|
|
|
| A060455 |
|
7th order Fibonacci numbers. |
|
+0
13
|
|
| 1, 1, 1, 1, 1, 1, 1, 7, 13, 25, 49, 97, 193, 385, 769, 1531, 3049, 6073, 12097, 24097, 48001, 95617, 190465, 379399, 755749, 1505425, 2998753, 5973409, 11898817, 23702017, 47213569, 94047739, 187339729, 373174033, 743349313, 1480725217
(list; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
a(n) = number of runs in polyphase sort using 8 tapes and n-6 phases.
|
|
REFERENCES
|
R. L. Gilstad, Polyphase Merge Sort - Advanced Technique, Proc. AFIPS Eastern Jt. Comp. Conf. 18 (1960) 143-148.
N. Wirth, Algorithmen und Datenstrukturen, 1975, (table 2.15 chapter 2.3.4)
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..200
|
|
FORMULA
|
a(n) = a(n-1)+a(n-2)+...+a(n-7) for n > 6, a(0)=a(1)=...=a(6)=1
|
|
EXAMPLE
|
General formula for k-th order numbers: f(n,k)=f(n-1,k)+...+f(n-1-k,k) for n > k, else f(n,k) = 1
|
|
MAPLE
|
A060455 := proc(n) option remember: if n >=0 and n<=6 then RETURN(1) fi: a(n-1)+a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7) end;
|
|
CROSSREFS
|
For k=1..5 see A000045, A000213, A000288, A000322, A000383.
Sequence in context: A087195 A031887 A111721 this_sequence A072579 A067870 A147258
Adjacent sequences: A060452 A060453 A060454 this_sequence A060456 A060457 A060458
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Frank Ellermann (Frank.Ellermann(AT)t-online.de), Apr 08 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 11 2001
|
|
|
Search completed in 0.002 seconds
|
