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!)
 A013823 a(n) = 2^(5*n + 2). 1
 4, 128, 4096, 131072, 4194304, 134217728, 4294967296, 137438953472, 4398046511104, 140737488355328, 4503599627370496, 144115188075855872, 4611686018427387904, 147573952589676412928, 4722366482869645213696 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (32). FORMULA From Philippe Deléham, Nov 24 2008: (Start) a(n) = 32*a(n-1); a(0)=4. G.f.: 4/(1-32*x). a(n) = 4*A009976(n). (End) PROG (MAGMA) [2^(5*n+2): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011 (Maxima) makelist(2^(5*n+2), n, 0, 20); /* Martin Ettl, Oct 21 2012 */ CROSSREFS Sequence in context: A291851 A128790 A267796 * A321233 A130318 A000318 Adjacent sequences:  A013820 A013821 A013822 * A013824 A013825 A013826 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 April 23 07:37 EDT 2021. Contains 343201 sequences. (Running on oeis4.)