|
%I #25 Jun 13 2015 00:49:12
%S 1,8,64,513,4104,32832,262657,2101256,16810048,134480385,1075843080,
%T 8606744640,68853957121,550831656968,4406653255744,35253226045953,
%U 282025808367624,2256206466940992,18049651735527937,144397213884223496,1155177711073787968
%N Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,0.
%H Vincenzo Librandi, <a href="/A033144/b033144.txt">Table of n, a(n) for n = 1..200</a>
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (8,0,1,-8).
%F a(n) = 8*a(n-1) + a(n-3) - 8*a(n-4).
%F G.f.: x / ((x-1)*(8*x-1)*(x^2+x+1)). - _Colin Barker_, Apr 30 2014
%F a(n) = round( (64/511)*8^n ). - _Tani Akinari_, Jul 15 2014
%t Module[{nn=30,d},d=PadRight[{},nn,{1,0,0}];Table[FromDigits[Take[d,n],8],{n,nn}]] (* or *) LinearRecurrence[{8,0,1,-8},{1,8,64,513},50] (* _Harvey P. Dale_, Nov 13 2013 *)
%t CoefficientList[Series[1/((x - 1) (8 x - 1) (x^2 + x + 1)), {x, 0, 40}], x] (* _Vincenzo Librandi_, May 01 2014 *)
%o (PARI) Vec(x/((x-1)*(8*x-1)*(x^2+x+1)) + O(x^100)) \\ _Colin Barker_, Apr 30 2014
%K nonn,base,easy
%O 1,2
%A _Clark Kimberling_
%E More terms from _Harvey P. Dale_, Nov 13 2013
|
