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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013710 a(n) = 5^(2*n + 1). 9

%I #27 Sep 08 2022 08:44:38

%S 5,125,3125,78125,1953125,48828125,1220703125,30517578125,

%T 762939453125,19073486328125,476837158203125,11920928955078125,

%U 298023223876953125,7450580596923828125,186264514923095703125

%N a(n) = 5^(2*n + 1).

%H Vincenzo Librandi, <a href="/A013710/b013710.txt">Table of n, a(n) for n = 0..200</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (25).

%F From _Philippe Deléham_, Nov 23 2008: (Start)

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

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

%F E.g.f.: 5*exp(25*x). - _Mohammad K. Azarian_, Dec 23 2008

%t NestList[25#&,5,20] (* _Harvey P. Dale_, Aug 08 2013 *)

%o (Magma) [5^(2*n+1): n in [0..20]]; // _Vincenzo Librandi_, May 26 2011

%o (PARI) a(n)=5^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Cf. A000351.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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 April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)