%I A079262
%S A079262 0,0,0,0,0,0,0,1,1,2,4,8,16,32,64,128,255,509,1016,2028,4048,8080,16128,
%T A079262 32192,64256,128257,256005,510994,1019960,2035872,4063664,8111200,
%U A079262 16190208,32316160,64504063,128752121,256993248,512966536,1023897200
%N A079262 Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = Sum_{i=1..8}
a(n-i).
%D A079262 Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas
n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article
05.4.4.
%H A079262 T. D. Noe, <a href="b079262.txt">Table of n, a(n) for n=0..207</a>
%F A079262 G.f.=x^7/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8). - Emeric Deutsch (deutsch(AT)duke.poly.edu),
Apr 16 2005
%F A079262 a(1-9)=1,1,2,4,8,16,32,64,128. a(10 & following)=63*2^(n-8)+(.5+sqrt1.25)^(n-6)/
sqrt5-(.5-sqrt1.25)^(n-6)/sqrt5. Offset 10. a(10)=255. [From Al Hakanson
(hawkuu(AT)gmail.com), Feb 14 2009]
%e A079262 a(16) = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 = 255.
%p A079262 for j from 0 to 6 do a[j]:=0 od: a[7]:=1: for n from 8 to 45 do a[n]:=sum(a[n-i],
i=1..8) od:seq(a[n],n=0..45); (Deutsch)
%t A079262 a=0;b=0;c=0;d=0;e=0;f=0;g=0;h=1;lst={a, b, c, d, e, f, g, h};Do[k=a+b+c+d+e+f+g+h;
AppendTo[lst, k];a=b;b=c;c=d;d=e;e=f;f=g;g=h;h=k, {n, 4!}];lst [From
Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 30 2008]
%Y A079262 Cf. A066178, A001592, A001591, A001630, A000073, A000045.
%Y A079262 Row 8 of arrays A048887 and A092921 (k-generalized Fibonacci numbers).
%Y A079262 Sequence in context: A054045 A008860 A145114 this_sequence A087079 A009694
A097000
%Y A079262 Adjacent sequences: A079259 A079260 A079261 this_sequence A079263 A079264
A079265
%K A079262 easy,nonn
%O A079262 0,10
%A A079262 Michael Joseph Halm (hierogamous(AT)lycos.com), Feb 04 2003
%E A079262 Corrected by Joao B. Oliveira (oliveira(AT)inf.pucrs.br), Nov 25 2004
%E A079262 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 16 2005
|