login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013823 2^(5*n+2). 1
4, 128, 4096, 131072, 4194304, 134217728, 4294967296, 137438953472, 4398046511104, 140737488355328, 4503599627370496, 144115188075855872, 4611686018427387904, 147573952589676412928, 4722366482869645213696 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=32*a(n-1), n>0 ; a(0)=4 . G.f.: 4/(1-32*x). a(n)=4*A009976(n). [From Philippe Deléham, Nov 24 2008]

PROG

(MAGMA) [2^(5*n+2): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011

(Maxima) makelist(2^(5*n+2), n, 0, 20); [Martin Ettl, Oct 21 2012]

CROSSREFS

Sequence in context: A070781 A152421 A128790 * A130318 A000318 A229385

Adjacent sequences:  A013820 A013821 A013822 * A013824 A013825 A013826

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 23 17:46 EDT 2014. Contains 240946 sequences.