|
%I #22 Sep 08 2022 08:44:38
%S 11,14641,19487171,25937424601,34522712143931,45949729863572161,
%T 61159090448414546291,81402749386839761113321,
%U 108347059433883722041830251,144209936106499234037676064081,191943424957750480504146841291811
%N a(n) = 11^(3*n + 1).
%H Vincenzo Librandi, <a href="/A013748/b013748.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)=11.
%F G.f.: 11/(1-1331*x).
%F a(n) = A013749(n)/11. (End)
%p seq(11^(3*n+1),n=0..10); # _Nathaniel Johnston_, Jun 26 2011
%o (Magma) [11^(3*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011
%o (PARI) a(n)=11^(3*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016
%Y Cf. A013749.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 