login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A013734
a(n) = 4^(3*n+1).
4
4, 256, 16384, 1048576, 67108864, 4294967296, 274877906944, 17592186044416, 1125899906842624, 72057594037927936, 4611686018427387904, 295147905179352825856, 18889465931478580854784, 1208925819614629174706176
OFFSET
0,1
COMMENTS
Additive digital root of a(n) = 4. - Miquel Cerda, Jul 02 2016
FORMULA
a(n) = 64*a(n-1), n>0 ; a(0)=4. G.f.: 4/(1-64*x). a(n)=4*A089357(n). - Philippe Deléham, Nov 24 2008
E.g.f.: 4*exp(64*x). - Ilya Gutkovskiy, Jul 02 2016
MAPLE
seq(4^(3*n+1), n=0..13); # Nathaniel Johnston, Jun 26 2011
MATHEMATICA
4^(3*Range[0, 20]+1) (* or *) NestList[64#&, 4, 20] (* Harvey P. Dale, Feb 22 2016 *)
PROG
(Magma) [4^(3*n+1): n in [0..20]]; // Vincenzo Librandi, May 25 2011
(PARI) Vec(4/(1-64*x) + O(x^99)) \\ Altug Alkan, Jul 05 2016
(PARI) a(n)=2^(6*n+2) \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
Cf. A013735.
Sequence in context: A093760 A062075 A266890 * A209588 A085534 A071617
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

  NODES
COMMUNITY 1
INTERN 1