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

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

%S 3,729,177147,43046721,10460353203,2541865828329,617673396283947,

%T 150094635296999121,36472996377170786403,8862938119652501095929,

%U 2153693963075557766310747,523347633027360537213511521

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

%H Vincenzo Librandi, <a href="/A013826/b013826.txt">Table of n, a(n) for n = 0..200</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 (243).

%F From _Philippe Deléham_, Nov 26 2008: (Start)

%F a(n) = 243*a(n-1); a(0)=3.

%F G.f.: 3/(1-243*x). (End)

%t NestList[243#&,3,20] (* _Harvey P. Dale_, Jan 26 2013 *)

%o (Magma) [3^(5*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011

%o (Maxima) makelist(3^(5*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

%o (PARI) a(n)=3^(5*n+1) \\ _Charles R Greathouse IV_, Jul 11 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 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)