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!)
A013788 a(n) = 8^(4*n + 1). 2
8, 32768, 134217728, 549755813888, 2251799813685248, 9223372036854775808, 37778931862957161709568, 154742504910672534362390528, 633825300114114700748351602688, 2596148429267413814265248164610048, 10633823966279326983230456482242756608 (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)=8.
G.f.: 8/(1-4096*x). (End)
MATHEMATICA
8^(4Range[0, 20]+1) (* Harvey P. Dale, Apr 17 2011 *)
PROG
(Magma) [8^(4*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011
(PARI) a(n)=8^(4*n+1) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Subsequence of A001018.
Sequence in context: A115478 A221629 A362280 * A156178 A256423 A349113
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)