Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013721
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013721 16^(2n+1). +0
2
16, 4096, 1048576, 268435456, 68719476736, 17592186044416, 4503599627370496, 1152921504606846976, 295147905179352825856, 75557863725914323419136, 19342813113834066795298816, 4951760157141521099596496896 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A087519 A060616 A016936 this_sequence A053859 A053863 A053765

Adjacent sequences: A013718 A013719 A013720 this_sequence A013722 A013723 A013724

KEYWORD

nonn,easy

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research