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

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

%S 130321,322687697779,799006685782884121,1978419655660313589123979,

%T 4898762930960846817716295277921,

%U 12129821994589221844500501021364910179,30034640110980377619945846078500632729311721,74368742344158402044370289529129338200416023056379

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

%H Vincenzo Librandi, <a href="/A013893/b013893.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 (2476099).

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

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

%Y Cf. A001029.

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