|
%I #23 Sep 08 2022 08:44:38
%S 9,531441,31381059609,1853020188851841,109418989131512359209,
%T 6461081889226673298932241,381520424476945831628649898809,
%U 22528399544939174411840147874772641,1330279464729113309844748891857449678409
%N a(n) = 9^(5*n + 1).
%H Vincenzo Librandi, <a href="/A013850/b013850.txt">Table of n, a(n) for n = 0..100</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 (59049).
%F From _Wesley Ivan Hurt_, Jan 02 2022: (Start)
%F G.f.: 9/(1-59049*x).
%F E.g.f.: 9*exp(59049*x).
%F a(n) = 59049*a(n-1).
%F a(n) = A001019(A016861(n)). (End)
%t Table[9^(5 n + 1), {n, 0, 12}] (* _Wesley Ivan Hurt_, Jan 02 2022 *)
%o (Magma) [9^(5*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jul 08 2011
%o (Maxima) makelist(9^(5*n+1),n,0,20); /* _Martin Ettl_, Oct 21 2012 */
%o (PARI) a(n) = 9^(5*n+1); \\ _Altug Alkan_, Sep 08 2018
%Y Cf. A001019, A016861.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 