OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..600
FORMULA
a(n) = Sum_{k=0..n} 9^(n-k) * (k+1) * binomial(n-2*k/3-1,n-k).
D-finite with recurrence (n-1)*(n-2)*a(n) -3*(n-2)*(11*n-29)*a(n-1) +135*(n-3)*(3*n-10)*a(n-2) +(-2188*n^2+17739*n-35909)*a(n-3) +3*(1466*n^2-14601*n+36292)*a(n-4) +27*(-7*n^2+37*n-42)*a(n-5) +54*(3*n-10)*(3*n-14)*a(n-6)=0. - R. J. Mathar, Apr 02 2025
MATHEMATICA
Table[Sum[9^(n-k)* (k+1)* Binomial[n-2*k/3-1, n-k], {k, 0, n}], {n, 0, 25}] (* Vincenzo Librandi, May 12 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, 9^(n-k)*(k+1)*binomial(n-2*k/3-1, n-k));
(Magma) R<x>:=PowerSeriesRing(Rationals(), 25); Coefficients(R!( 1/(1 - x/(1 - 9*x)^(1/3))^2)); // Vincenzo Librandi, May 12 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 31 2025
STATUS
approved
