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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013900 a(n) = 21^(5*n + 3). 1

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

%S 9261,37822859361,154472377739119461,630880792396715529789561,

%T 2576580875108218291929075869661,

%U 10523016528610349434285830688358359761,42977062327514056734916195400155065458259861,175522663228862486625127968549968702993144556569961

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

%H Vincenzo Librandi, <a href="/A013900/b013900.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)=9261. - _Vincenzo Librandi_, May 27 2011

%o (Magma) [21^(5*n+3): 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.

Last modified September 11 17:54 EDT 2024. Contains 375839 sequences. (Running on oeis4.)