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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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; text; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (4096).

FORMULA

a(n)=4096*a(n-1), n>0 ; a(0)=256 . G.f.: 256/(1-4096*x). a(n)=16*A013758(n). - Philippe Deléham, Dec 03 2008

PROG

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

(PARI) a(n)=16^(3*n+2) \\ Charles R Greathouse IV, Jul 11 2016

CROSSREFS

Sequence in context: A018877 A283803 A278142 * A283933 A016832 A103350

Adjacent sequences:  A013756 A013757 A013758 * A013760 A013761 A013762

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 28 19:46 EDT 2017. Contains 287241 sequences.