|
%I #31 Sep 08 2022 08:44:38
%S 8,512,32768,2097152,134217728,8589934592,549755813888,35184372088832,
%T 2251799813685248,144115188075855872,9223372036854775808,
%U 590295810358705651712,37778931862957161709568,2417851639229258349412352
%N a(n) = 8^(2n+1).
%C Additive digital root of a(n) = 8. - _Miquel Cerda_, Jul 03 2016
%H Vincenzo Librandi, <a href="/A013713/b013713.txt">Table of n, a(n) for n = 0..160</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (64).
%F a(n) = 64a(n-1), n>0. O.g.f.: 8/(1-64x). - _R. J. Mathar_, May 07 2008
%F a(n) = 8*A089357(n) = 2*A013734(n) = A013735(n)/2 . - _Philippe Deléham_, Nov 24 2008
%F From _Ilya Gutkovskiy_, Jul 03 2016: (Start)
%F E.g.f.: 8*exp(64*x).
%F a(n) = A001018(A005408(n)). (End)
%t 8^(2*Range[0,20]+1) (* or *) NestList[64#&,8,20] (* _Harvey P. Dale_, Feb 27 2013 *)
%o (Magma) [8^(2*n+1): n in [0..20]]; // _Vincenzo Librandi_, May 25 2011
%o (PARI) x='x+O('x^99); Vec(8/(1-64*x)) \\ _Altug Alkan_, Jul 09 2016
%o (PARI) a(n)=8<<(3*n) \\ _Charles R Greathouse IV_, Jul 11 2016
%Y Cf. A001018, A013734, A013735, A089357.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_.
| 