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!)
A013789 a(n) = 8^(4*n + 3). 1
512, 2097152, 8589934592, 35184372088832, 144115188075855872, 590295810358705651712, 2417851639229258349412352, 9903520314283042199192993792, 40564819207303340847894502572032, 166153499473114484112975882535043072 (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)=512.
G.f.: 512/(1-4096*x).
a(n) = 2*A013759(n). (End)
PROG
(Magma) [8^(4*n+3): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011
CROSSREFS
Subsequence of A001018.
Sequence in context: A220303 A323542 A016797 * A330484 A283935 A016833
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 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)