|
%I
%S 0,1,8,9,16,17,24,25,32,33,40,41,48,49,56,57,64,65,72,73,80,81,88,89,
%T 96,97,104,105,112,113,120,121,128,129,136,137,144,145,152,153,160,
%U 161,168,169,176,177,184,185,192,193,200,201,208,209,216,217,224,225,232
%N Numbers that are congruent to {0, 1} mod 8.
%H <a href="/index/Rea#recLCC">Index to sequences with linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F a(n)=8*n-a(n-1)-15 (with a(1)=0) [From _Vincenzo Librandi_, Aug 05 2010]
%F a(n)=4*n-11/2-3*(-1)^n/2. G.f. x^2*(1+7*x) / ( (1+x)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011
%F a(n+1)=Sum_k>=0 {A030308(n,k)*A146541(k)}. - From Philippe Deléham, Oct 17 2011.
%p a[0]:=0:a[1]:=1:for n from 2 to 100 do a[n]:=a[n-2]+8 od: seq(a[n], n=0..58); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008
%o (PARI) forstep(n=0,200,[1,7],print1(n", ")) \\ _Charles R Greathouse IV_, Oct 17 2011
%K nonn,easy
%O 1,3
%A _N. J. A. Sloane_.
%E More terms from _James A. Sellers_, Jun 20 2000
|
