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!)
 A013721 a(n) = 16^(2*n + 1). 3
 16, 4096, 1048576, 268435456, 68719476736, 17592186044416, 4503599627370496, 1152921504606846976, 295147905179352825856, 75557863725914323419136, 19342813113834066795298816, 4951760157141521099596496896 (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)=16. G.f.: 16/(1-256*x). a(n) = 4*A013780(n). (End) MATHEMATICA NestList[256#&, 16, 20] (* Harvey P. Dale, Oct 28 2015 *) PROG (MAGMA) [16^(2*n+1): n in [0..15]]; // Vincenzo Librandi, Jun 04 2011 (PARI) a(n)=16^(2*n+1) \\ Charles R Greathouse IV, Jul 11 2016 CROSSREFS Sequence in context: A297387 A016936 A321242 * A053859 A053863 A053765 Adjacent sequences:  A013718 A013719 A013720 * A013722 A013723 A013724 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 26 17:19 EST 2020. Contains 332293 sequences. (Running on oeis4.)