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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013758 a(n) = 16^(3n+1). 2
16, 65536, 268435456, 1099511627776, 4503599627370496, 18446744073709551616, 75557863725914323419136, 309485009821345068724781056, 1267650600228229401496703205376, 5192296858534827628530496329220096 (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)=16. G.f.: 16/(1-4096*x). a(n) = 2*A013788(n). - Philippe Deléham, Dec 03 2008

MATHEMATICA

lst={}; Do[AppendTo[lst, 16^(3*n+1)], {n, 0, 4!}]; lst (* Vladimir Joseph Stephan Orlovsky, Mar 02 2009 *)

PROG

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

(PARI) a(n)=16<<(12*n) \\ Charles R Greathouse IV, May 24, 2011

CROSSREFS

Sequence in context: A185141 A087586 A105312 * A078186 A217026 A087926

Adjacent sequences:  A013755 A013756 A013757 * A013759 A013760 A013761

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 August 21 21:36 EDT 2017. Contains 290908 sequences.