%I A060455
%S A060455 1,1,1,1,1,1,1,7,13,25,49,97,193,385,769,1531,3049,6073,12097,24097,
%T A060455 48001,95617,190465,379399,755749,1505425,2998753,5973409,11898817,
%U A060455 23702017,47213569,94047739,187339729,373174033,743349313,1480725217
%N A060455 7th order Fibonacci numbers.
%C A060455 a(n) = number of runs in polyphase sort using 8 tapes and n-6 phases.
%D A060455 R. L. Gilstad, Polyphase Merge Sort - Advanced Technique, Proc. AFIPS 
               Eastern Jt. Comp. Conf. 18 (1960) 143-148.
%D A060455 N. Wirth, Algorithmen und Datenstrukturen, 1975, (table 2.15 chapter 
               2.3.4)
%H A060455 T. D. Noe, <a href="b060455.txt">Table of n, a(n) for n=0..200</a>
%F A060455 a(n) = a(n-1)+a(n-2)+...+a(n-7) for n > 6, a(0)=a(1)=...=a(6)=1
%e A060455 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
%p A060455 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;
%Y A060455 For k=1..5 see A000045, A000213, A000288, A000322, A000383.
%Y A060455 Sequence in context: A087195 A031887 A111721 this_sequence A072579 A067870 
               A147258
%Y A060455 Adjacent sequences: A060452 A060453 A060454 this_sequence A060456 A060457 
               A060458
%K A060455 easy,nonn
%O A060455 0,8
%A A060455 Frank Ellermann (Frank.Ellermann(AT)t-online.de), Apr 08 2001
%E A060455 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 11 2001