Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013789
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013789 8^(4n+3). +0
1
512, 2097152, 8589934592, 35184372088832, 144115188075855872, 590295810358705651712, 2417851639229258349412352, 9903520314283042199192993792, 40564819207303340847894502572032, 166153499473114484112975882535043072 (list; graph; listen)
OFFSET

0,1

LINKS

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]

CROSSREFS

Sequence in context: A016749 A144323 A016797 this_sequence A016833 A103352 A013848

Adjacent sequences: A013786 A013787 A013788 this_sequence A013790 A013791 A013792

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research