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!)
A013743 a(n) = 8^(3*n + 2). 2
64, 32768, 16777216, 8589934592, 4398046511104, 2251799813685248, 1152921504606846976, 590295810358705651712, 302231454903657293676544, 154742504910672534362390528, 79228162514264337593543950336, 40564819207303340847894502572032 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Nov 28 2008: (Start)
a(n) = 512*a(n-1); a(0)=64.
G.f.: 64/(1-512*x).
a(n) = 8*A013742(n). (End)
MAPLE
seq(8^(3*n+2), n=0..11); # Nathaniel Johnston, Jun 26 2011
MATHEMATICA
NestList[512#&, 64, 20] (* Harvey P. Dale, Oct 30 2015 *)
PROG
(Magma) [8^(3*n+2): n in [0..20]]; // Vincenzo Librandi, Jun 26 2011
(PARI) a(n)=8^(3*n+2) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Cf. A013742.
Sequence in context: A009497 A145258 A202911 * A223353 A098843 A159400
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 March 19 04:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)