Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013823
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013823 2^(5n+2). +0
1
4, 128, 4096, 131072, 4194304, 134217728, 4294967296, 137438953472, 4398046511104, 140737488355328, 4503599627370496, 144115188075855872, 4611686018427387904, 147573952589676412928, 4722366482869645213696 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A070781 A152421 A128790 this_sequence A130318 A000318 A141367

Adjacent sequences: A013820 A013821 A013822 this_sequence A013824 A013825 A013826

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