The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A013759 a(n) = 16^(3n + 2). 2
256, 1048576, 4294967296, 17592186044416, 72057594037927936, 295147905179352825856, 1208925819614629174706176, 4951760157141521099596496896 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Dec 03 2008: (Start)
a(n) = 4096*a(n-1), a(0)=256.
G.f.: 256/(1-4096*x).
a(n) = 16*A013758(n). (End)
MATHEMATICA
16^(3*Range[0, 10]+2) (* or *) NestList[4096#&, 256, 10] (* Harvey P. Dale, Dec 04 2023 *)
PROG
(Magma) [16^(3*n+2): n in [0..15]]; // Vincenzo Librandi, May 24 2011
(PARI) a(n)=16^(3*n+2) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Sequence in context: A283803 A330483 A278142 * A283933 A016832 A103350
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 June 14 21:14 EDT 2024. Contains 373401 sequences. (Running on oeis4.)