The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013836 a(n) = 5^(5*n + 3). 1
 125, 390625, 1220703125, 3814697265625, 11920928955078125, 37252902984619140625, 116415321826934814453125, 363797880709171295166015625, 1136868377216160297393798828125, 3552713678800500929355621337890625 (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 (3125). FORMULA From Philippe Deléham, Dec 03 2008: (Start) a(n) = 3125*a(n-1), n > 0; a(0)=125. G.f.: 125/(1-3125*x). (End) PROG (Magma) [5^(5*n+3): n in [0..15]]; // Vincenzo Librandi, Jul 07 2011 (PARI) a(n)=5^(5*n+3) \\ Edward Jiang, Sep 06 2014 CROSSREFS Cf. A000351 (5^n), A016885 (5*n+3). Sequence in context: A318258 A003751 A120807 * A048563 A239060 A365898 Adjacent sequences: A013833 A013834 A013835 * A013837 A013838 A013839 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 December 4 21:08 EST 2023. Contains 367565 sequences. (Running on oeis4.)