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!)
A013767 a(n) = 20^(3*n + 2). 1

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

%S 400,3200000,25600000000,204800000000000,1638400000000000000,

%T 13107200000000000000000,104857600000000000000000000,

%U 838860800000000000000000000000,6710886400000000000000000000000000,53687091200000000000000000000000000000

%N a(n) = 20^(3*n + 2).

%H Vincenzo Librandi, <a href="/A013767/b013767.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 (8000).

%t NestList[8000#&,400,10] (* _Harvey P. Dale_, May 11 2018 *)

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

%o (PARI) a(n)=20^(3*n+2) \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Subsequence of A009964.

%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 25 12:53 EDT 2024. Contains 371969 sequences. (Running on oeis4.)