OFFSET
1,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..300
FORMULA
a(n+1) = Sum_{k=0..n} A132393(n,k)*5^k*9^(n-k). - Philippe Deléham, Nov 09 2008
From R. J. Mathar, Nov 09 2008: (Start)
a(n) = a(n-1) + (4 + 9*(n-2))*a(n-1) = (9*n-13)*a(n-1).
a(n) = 9^(n-1)*Gamma(n-4/9)/Gamma(5/9).
G.f.: z*2F0(5/9,1; -; 9*z). (End)
a(n) = (-4)^n*Sum_{k=0..n} (9/4)^k*s(n+1,n+1-k), where s(n,k) are the Stirling numbers of the first kind, A048994. - Mircea Merca, May 03 2012
Sum_{n>=1} 1/a(n) = 1 + (e/9^4)^(1/9)*(Gamma(5/9) - Gamma(5/9, 1/9)). - Amiram Eldar, Dec 21 2022
MAPLE
seq(9^(n-1)*pochhammer(5/9, n-1), n = 1..20); # G. C. Greubel, Dec 03 2019
MATHEMATICA
Table[9^(n-1)*Pochhammer[5/9, n-1], {n, 20}] (* G. C. Greubel, Dec 03 2019 *)
PROG
(PARI) vector(20, n, prod(j=0, n-2, 9*j+5) ) \\ G. C. Greubel, Dec 03 2019
(Magma) [Round(9^(n-1)*Gamma(n-1 +5/9)/Gamma(5/9)): n in [1..20]]; // G. C. Greubel, Dec 03 2019
(Sage) [9^(n-1)*rising_factorial(5/9, n-1) for n in (1..20)] # G. C. Greubel, Dec 03 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Joseph Stephan Orlovsky, Nov 08 2008
STATUS
approved