Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013759
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013759 16^(3n+2). +0
2
256, 1048576, 4294967296, 17592186044416, 72057594037927936, 295147905179352825856, 1208925819614629174706176, 4951760157141521099596496896 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A100636 A016796 A018877 this_sequence A016832 A103350 A069447

Adjacent sequences: A013756 A013757 A013758 this_sequence A013760 A013761 A013762

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research