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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013789 8^(4n+3). 1
512, 2097152, 8589934592, 35184372088832, 144115188075855872, 590295810358705651712, 2417851639229258349412352, 9903520314283042199192993792, 40564819207303340847894502572032, 166153499473114484112975882535043072 (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)=4096*a(n-1), n>0 ; a(0)=512 . G.f.: 512/(1-4096*x). a(n)=2*A013759(n). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 03 2008]

PROG

(MAGMA) [8^(4*n+3): n in [0..15]]; // Vincenzo Librandi, Jun 28 2011

CROSSREFS

Sequence in context: A016749 A144323 A016797 * A016833 A103352 A013848

Adjacent sequences:  A013786 A013787 A013788 * A013790 A013791 A013792

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 18 00:14 EST 2012. Contains 206085 sequences.