Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013824
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013824 2^(5n+3). +0
1
8, 256, 8192, 262144, 8388608, 268435456, 8589934592, 274877906944, 8796093022208, 281474976710656, 9007199254740992, 288230376151711744, 9223372036854775808, 295147905179352825856, 9444732965739290427392 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A034674 A130034 A128787 this_sequence A010044 A024290 A140338

Adjacent sequences: A013821 A013822 A013823 this_sequence A013825 A013826 A013827

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research