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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013776 2^(4n+1). 2
2, 32, 512, 8192, 131072, 2097152, 33554432, 536870912, 8589934592, 137438953472, 2199023255552, 35184372088832, 562949953421312, 9007199254740992, 144115188075855872, 2305843009213693952 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=16*a(n-1), n>0 ; a(0)=2 . G.f.: 2/(1-16x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]

PROG

(MAGMA) [2^(4*n+1): n in [0..20]]; // Vincenzo Librandi, Jun 27 2011

CROSSREFS

Sequence in context: A115418 A163952 A022028 * A174491 A022019 A010045

Adjacent sequences:  A013773 A013774 A013775 * A013777 A013778 A013779

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

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

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.