Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013758
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013758 16^(3n+1). +0
2
16, 65536, 268435456, 1099511627776, 4503599627370496, 18446744073709551616, 75557863725914323419136, 309485009821345068724781056, 1267650600228229401496703205376, 5192296858534827628530496329220096 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

MATHEMATICA

lst={}; Do[AppendTo[lst, 16^(3*n+1)], {n, 0, 4!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 02 2009]

CROSSREFS

Sequence in context: A017548 A087586 A105312 this_sequence A078186 A087926 A144830

Adjacent sequences: A013755 A013756 A013757 this_sequence A013759 A013760 A013761

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Added more terms, Mathematica. - Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 02 2009

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 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research