A013735 a(n) = 4^(3*n+2).

16, 1024, 65536, 4194304, 268435456, 17179869184, 1099511627776, 70368744177664, 4503599627370496, 288230376151711744, 18446744073709551616, 1180591620717411303424, 75557863725914323419136, 4835703278458516698824704

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Comments

Additive digital root of a(n) = 7. - Miquel Cerda, Jul 03 2016

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..100
• Tanya Khovanova, Recursive Sequences
• Index to divisibility sequences
• Index entries for linear recurrences with constant coefficients, signature (64).

Crossrefs

Cf. A089357, A013734, A013713. - Philippe Deléham, Nov 24 2008

Programs

Magma

[4^(3*n+2): n in [0..50]]; // Vincenzo Librandi, Apr 25 2011

Maple

seq(4^(3*n+2),n=0..13); # Nathaniel Johnston, Jun 26 2011

Mathematica

lst={};Do[AppendTo[lst,4^(3*n+2)],{n,0,4!}];lst (* Vladimir Joseph Stephan Orlovsky, Mar 02 2009 *)
NestList[64#&,16,20] (* Harvey P. Dale, Nov 04 2017 *)

PARI

16<<(6*n) \\ Charles R Greathouse IV, Jan 19 2012

Formula

G.f.: 16/(1-64*x). - Philippe Deléham, Nov 24 2008

From Ilya Gutkovskiy, Jul 03 2016: (Start)

E.g.f.: 16*exp(64*x).

a(n) = A000302(A016789(n)). (End)

a(n) = 64*a(n-1). - Miquel Cerda, Oct 28 2016