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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013831 a(n) = 4^(5n+2). 2
16, 16384, 16777216, 17179869184, 17592186044416, 18014398509481984, 18446744073709551616, 18889465931478580854784, 19342813113834066795298816, 19807040628566084398385987584, 20282409603651670423947251286016 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
a(n) = 1024*a(n-1), n>0; a(0)=16. G.f.: 16/(1-1024*x). a(n) = 4*A013830(n). - Philippe Deléham, Nov 30 2008
MATHEMATICA
lst={}; Do[AppendTo[lst, 4^(5*n+2)], {n, 0, 4!}]; lst (* Vladimir Joseph Stephan Orlovsky, Mar 02 2009 *)
4^(5*Range[0, 20]+2) (* or *) NestList[1024#&, 16, 20] (* Harvey P. Dale, Apr 02 2018 *)
PROG
(Magma) [4^(5*n+2): n in [0..40]]; // Vincenzo Librandi, Apr 25 2011
(PARI) a(n)=4^(5*n+2) \\ Charles R Greathouse IV, Jan 19 2012
CROSSREFS
Sequence in context: A249968 A017188 A168576 * A214637 A288957 A159387
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)