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

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

%S 19,47045881,116490258898219,288441413567621167681,

%T 714209495693373205673756419,1768453418076865701195582595329481,

%U 4378865740046709085864680868712732574619,10842505080063916320800450434338728415281531281,26847115986241183138017674520015691090350184323352819

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

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

%t NestList[2476099#&,19,20] (* _Harvey P. Dale_, Dec 23 2016 *)

%o (Magma) [19^(5*n+1): 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 10:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)