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!)
A013742 a(n) = 8^(3*n + 1). 2
8, 4096, 2097152, 1073741824, 549755813888, 281474976710656, 144115188075855872, 73786976294838206464, 37778931862957161709568, 19342813113834066795298816, 9903520314283042199192993792, 5070602400912917605986812821504 (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)=8.
G.f.: 8/(1-512*x). (End)
MAPLE
seq(8^(3*n+1), n=0..11); # Nathaniel Johnston, Jun 26 2011
PROG
(Magma) [8^(3*n+1): n in [0..20]]; // Vincenzo Librandi, Jun 26 2011
(PARI) a(n)=8^(3*n+1) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Cf. A013743.
Sequence in context: A351409 A024113 A167059 * A209592 A060760 A203436
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 18 18:49 EDT 2024. Contains 371781 sequences. (Running on oeis4.)