The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013713 a(n) = 8^(2n+1). 5
 8, 512, 32768, 2097152, 134217728, 8589934592, 549755813888, 35184372088832, 2251799813685248, 144115188075855872, 9223372036854775808, 590295810358705651712, 37778931862957161709568, 2417851639229258349412352 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Additive digital root of a(n) = 8. - Miquel Cerda, Jul 03 2016 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..160 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (64). FORMULA a(n) = 64a(n-1), n>0. O.g.f.: 8/(1-64x). - R. J. Mathar, May 07 2008 a(n) = 8*A089357(n) = 2*A013734(n) = A013735(n)/2 . - Philippe Deléham, Nov 24 2008 From Ilya Gutkovskiy, Jul 03 2016: (Start) E.g.f.: 8*exp(64*x). a(n) = A001018(A005408(n)). (End) MATHEMATICA 8^(2*Range[0, 20]+1) (* or *) NestList[64#&, 8, 20] (* Harvey P. Dale, Feb 27 2013 *) PROG (Magma) [8^(2*n+1): n in [0..20]]; // Vincenzo Librandi, May 25 2011 (PARI) x='x+O('x^99); Vec(8/(1-64*x)) \\ Altug Alkan, Jul 09 2016 (PARI) a(n)=8<<(3*n) \\ Charles R Greathouse IV, Jul 11 2016 CROSSREFS Cf. A001018, A013734, A013735, A089357. Sequence in context: A195804 A145259 A154025 * A109966 A139567 A035131 Adjacent sequences: A013710 A013711 A013712 * A013714 A013715 A013716 KEYWORD nonn,easy AUTHOR N. J. A. Sloane. STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 10 21:37 EDT 2024. Contains 375795 sequences. (Running on oeis4.)