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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013735 a(n) = 4^(3*n+2). 4
16, 1024, 65536, 4194304, 268435456, 17179869184, 1099511627776, 70368744177664, 4503599627370496, 288230376151711744, 18446744073709551616, 1180591620717411303424, 75557863725914323419136, 4835703278458516698824704 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

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).

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

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 *)

PROG

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

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

CROSSREFS

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

Sequence in context: A197104 A067490 A130036 * A180376 A162008 A195619

Adjacent sequences:  A013732 A013733 A013734 * A013736 A013737 A013738

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 March 24 07:54 EDT 2017. Contains 283985 sequences.