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!)
A013822 a(n) = 2^(5*n + 1). 3
2, 64, 2048, 65536, 2097152, 67108864, 2147483648, 68719476736, 2199023255552, 70368744177664, 2251799813685248, 72057594037927936, 2305843009213693952, 73786976294838206464, 2361183241434822606848 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Nov 24 2008: (Start)
a(n) = 32*a(n-1), n > 0; a(0)=2.
G.f.: 2/(1-32*x).
a(n) = 2*A009976(n). (End)
MATHEMATICA
2^(5*Range[0, 20]+1) (* or *) NestList[32#&, 2, 20] (* Harvey P. Dale, Aug 20 2020 *)
PROG
(Magma) [2^(5*n+1): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011
(PARI) a(n)=2^(5*n+1) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Cf. A000079 (2^n), A016861 (5*n+1).
Sequence in context: A217268 A122603 A127691 * A010047 A187548 A300640
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 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)