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!)
A013897 a(n) = 20^(5*n + 4). 1

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

%S 160000,512000000000,1638400000000000000,5242880000000000000000000,

%T 16777216000000000000000000000000,

%U 53687091200000000000000000000000000000,171798691840000000000000000000000000000000000,549755813888000000000000000000000000000000000000000

%N a(n) = 20^(5*n + 4).

%H Vincenzo Librandi, <a href="/A013897/b013897.txt">Table of n, a(n) for n = 0..50</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 (3200000).

%F a(n) = 3200000*a(n-1), a(0)=160000. - _Vincenzo Librandi_, May 27 2011

%t 20^(5*Range[0,10]+4) (* or *) NestList[3200000#&,160000,10] (* _Harvey P. Dale_, Feb 15 2016 *)

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

%Y Cf. A009964.

%K nonn

%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 25 09:10 EDT 2024. Contains 371964 sequences. (Running on oeis4.)