Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013833
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013833 4^(5n+4). +0
1
256, 262144, 268435456, 274877906944, 281474976710656, 288230376151711744, 295147905179352825856, 302231454903657293676544, 309485009821345068724781056, 316912650057057350374175801344, 324518553658426726783156020576256 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A144322 A013997 A118056 this_sequence A100636 A016796 A018877

Adjacent sequences: A013830 A013831 A013832 this_sequence A013834 A013835 A013836

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research