login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013759 16^(3n+2). 2
256, 1048576, 4294967296, 17592186044416, 72057594037927936, 295147905179352825856, 1208925819614629174706176, 4951760157141521099596496896 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..100

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]

PROG

(MAGMA) [16^(3*n+2): n in [0..15]]; // Vincenzo Librandi, May 24 2011

CROSSREFS

Sequence in context: A100636 A016796 A018877 * A016832 A103350 A069447

Adjacent sequences:  A013756 A013757 A013758 * A013760 A013761 A013762

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:09 EST 2012. Contains 205614 sequences.