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

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

%S 361,893871739,2213314919066161,5480386857784802185939,

%T 13569980418174090907801371961,33600614943460448322716069311260139,

%U 83198449060887472631428936505541918917761,206007596521214410095208558252435839890349094339

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

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

%t 19^(5*Range[0,20]+2) (* _Harvey P. Dale_, Apr 27 2012 *)

%o (Magma) [19^(5*n+2): 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 24 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)