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!)
A013899 a(n) = 21^(5*n + 2). 1

%I #19 Sep 26 2023 16:31:07

%S 441,1801088541,7355827511386641,30041942495081691894741,

%T 122694327386105632949003612841,501096025171921401632658604207540941,

%U 2046526777500669368329342638102622164679041,8358222058517261267863236597617557285387836027141

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

%H Vincenzo Librandi, <a href="/A013899/b013899.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 (4084101).

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

%t NestList[4084101#&,441,10] (* _Harvey P. Dale_, Sep 26 2023 *)

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

%Y Cf. A009965.

%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 11:36 EDT 2024. Contains 371968 sequences. (Running on oeis4.)