The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013781 a(n) = 4^(4*n + 3). 1
 64, 16384, 4194304, 1073741824, 274877906944, 70368744177664, 18014398509481984, 4611686018427387904, 1180591620717411303424, 302231454903657293676544, 77371252455336267181195264, 19807040628566084398385987584 (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 (256). FORMULA From Philippe Deléham, Nov 27 2008: (Start) a(n) = 256*a(n-1); a(0)=64. G.f.: 64/(1-256*x). a(n) = 4*A013721(n). (End) PROG (MAGMA) [4^(4*n+3): n in [0..15]]; // Vincenzo Librandi, Jun 04 2011 (Maxima) makelist(4^(4*n+3), n, 0, 20); /* Martin Ettl, Oct 21 2012 */ (PARI) a(n) = 4^(4*n+3); \\ Altug Alkan, Sep 08 2018 CROSSREFS Cf. A013721. Sequence in context: A123051 A064068 A220853 * A330482 A187407 A271241 Adjacent sequences:  A013778 A013779 A013780 * A013782 A013783 A013784 KEYWORD nonn 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 02:19 EDT 2020. Contains 337164 sequences. (Running on oeis4.)