The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013734 a(n) = 4^(3*n+1). 4
4, 256, 16384, 1048576, 67108864, 4294967296, 274877906944, 17592186044416, 1125899906842624, 72057594037927936, 4611686018427387904, 295147905179352825856, 18889465931478580854784, 1208925819614629174706176 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Additive digital root of a(n) = 4. - Miquel Cerda, Jul 02 2016
LINKS
Tanya Khovanova, Recursive Sequences
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 07:40 EDT 2024. Contains 373492 sequences. (Running on oeis4.)