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

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

%S 361,2476099,16983563041,116490258898219,799006685782884121,

%T 5480386857784802185939,37589973457545958193355601,

%U 257829627945307727248226067259,1768453418076865701195582595329481

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

%H Vincenzo Librandi, <a href="/A013765/b013765.txt">Table of n, a(n) for n = 0..90</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 (6859).

%F a(n) = 6859*a(n-1), a(0)=361. - _Vincenzo Librandi_, May 24 2011

%t NestList[6859#&,361,10] (* _Harvey P. Dale_, Aug 19 2019 *)

%o (Magma) [19^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, May 24 2011

%o (PARI) a(n)=19^(3*n+2) \\ _Charles R Greathouse IV_, Jul 10 2016

%K nonn,easy

%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 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)