This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013832 a(n) = 4^(5*n + 3). 2
 64, 65536, 67108864, 68719476736, 70368744177664, 72057594037927936, 73786976294838206464, 75557863725914323419136, 77371252455336267181195264, 79228162514264337593543950336, 81129638414606681695789005144064 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..100 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (1024). FORMULA From Philippe Deléham, Nov 30 2008: (Start) a(n) = 1024*a(n-1); a(0)=64. G.f.: 64/(1-1024*x). a(n) = 4*A013831(n). (End) MATHEMATICA 4^(5*Range[0, 20]+3) (* or *) NestList[1024#&, 64, 20] (* Harvey P. Dale, May 28 2013 *) PROG (MAGMA) [4^(5*n+3): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011 (Maxima) makelist(4^(5*n+3), n, 0, 20); /* Martin Ettl, Oct 21 2012 */ (PARI) a(n)=4^(5*n+3) \\ Charles R Greathouse IV, Jul 11 2016 CROSSREFS Sequence in context: A069445 A227604 A159677 * A034989 A187242 A159410 Adjacent sequences:  A013829 A013830 A013831 * A013833 A013834 A013835 KEYWORD nonn,easy AUTHOR STATUS approved

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

Last modified November 13 17:46 EST 2018. Contains 317149 sequences. (Running on oeis4.)