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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013710 a(n) = 5^(2*n + 1). 9
5, 125, 3125, 78125, 1953125, 48828125, 1220703125, 30517578125, 762939453125, 19073486328125, 476837158203125, 11920928955078125, 298023223876953125, 7450580596923828125, 186264514923095703125 (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 (25).

FORMULA

From Philippe Deléham, Nov 23 2008: (Start)

a(n) = 25*a(n-1); a(0)=5.

G.f.: 5/(1-25*x). (End)

E.g.f.: 5*exp(25*x). - Mohammad K. Azarian, Dec 23 2008

MATHEMATICA

NestList[25#&, 5, 20] (* Harvey P. Dale, Aug 08 2013 *)

PROG

(Magma) [5^(2*n+1): n in [0..20]]; // Vincenzo Librandi, May 26 2011

(PARI) a(n)=5^(2*n+1) \\ Charles R Greathouse IV, Jul 11 2016

CROSSREFS

Cf. A000351.

Sequence in context: A067081 A195801 A154022 * A202628 A358110 A109345

Adjacent sequences: A013707 A013708 A013709 * A013711 A013712 A013713

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 15:27 EST 2022. Contains 358588 sequences. (Running on oeis4.)