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!)
A013833 a(n) = 4^(5*n + 4). 1
256, 262144, 268435456, 274877906944, 281474976710656, 288230376151711744, 295147905179352825856, 302231454903657293676544, 309485009821345068724781056, 316912650057057350374175801344, 324518553658426726783156020576256 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Nov 30 2008: (Start)
a(n) = 1024*a(n-1), n > 0; a(0)=256.
G.f.: 256/(1-1024*x).
a(n) = 4*A013832(n). (End)
PROG
(Magma) [4^(5*n+4): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011
CROSSREFS
Cf. A000302 (4^n), A016897 (5*n+4).
Sequence in context: A118056 A185563 A220302 * A100636 A369824 A016796
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 27 08:40 EDT 2024. Contains 372017 sequences. (Running on oeis4.)