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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013830 a(n) = 4^(5*n + 1). 3
 4, 4096, 4194304, 4294967296, 4398046511104, 4503599627370496, 4611686018427387904, 4722366482869645213696, 4835703278458516698824704, 4951760157141521099596496896, 5070602400912917605986812821504 (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 (1024). FORMULA From Philippe Deléham, Nov 30 2008: (Start) a(n) = 1024*a(n-1), n > 0; a(0)=4. G.f.: 4/(1-1024*x). (End) MATHEMATICA 4^(5Range[0, 20]+1) (* or *) NestList[1024#&, 4, 20] (* Harvey P. Dale, Oct 04 2011 *) PROG (Magma) [4^(5*n+1): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011 (PARI) a(n)=4^(5*n+1) \\ Charles R Greathouse IV, Jul 11 2016 CROSSREFS Cf. A000302 (4^n), A016861 (5*n+1). Sequence in context: A221191 A110104 A024061 * A320860 A067482 A249804 Adjacent sequences: A013827 A013828 A013829 * A013831 A013832 A013833 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 21:27 EDT 2024. Contains 373401 sequences. (Running on oeis4.)