login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


a(n) = 11^(3*n + 2).
2

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

%S 121,161051,214358881,285311670611,379749833583241,505447028499293771,

%T 672749994932560009201,895430243255237372246531,

%U 1191817653772720942460132761,1586309297171491574414436704891,2111377674535255285545615254209921

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

%H Vincenzo Librandi, <a href="/A013749/b013749.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 (1331).

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

%F a(n) = 1331*a(n-1); a(0)=121.

%F G.f.: 121/(1-1331*x).

%F a(n) = 11*A013748(n). (End)

%p seq(11^(3*n+2),n=0..10); # _Nathaniel Johnston_, Jun 26 2011

%t NestList[1331#&,121,10] (* _Harvey P. Dale_, Dec 24 2014 *)

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

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

%Y Cf. A013748.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 24 02:17 EDT 2024. Contains 376185 sequences. (Running on oeis4.)