Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013788
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013788 8^(4n+1). +0
2
8, 32768, 134217728, 549755813888, 2251799813685248, 9223372036854775808, 37778931862957161709568, 154742504910672534362390528, 633825300114114700748351602688, 2596148429267413814265248164610048, 10633823966279326983230456482242756608 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=4096*a(n-1), n>0 ; a(0)=8 . G.f.: 8/(1-4096*x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 03 2008]

CROSSREFS

Sequence in context: A067074 A067070 A115478 this_sequence A156178 A063374 A067055

Adjacent sequences: A013785 A013786 A013787 this_sequence A013789 A013790 A013791

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research