OFFSET
0,2
COMMENTS
For each positive integer k, the sequence obtained by reducing a(n) modulo k is a periodic sequence with period dividing k. For example, modulo 6 the sequence becomes [1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, ...] with period 6. Cf. A047974. - Peter Bala, Mar 13 2025
FORMULA
a(n) = n! * Sum_{k=0..n} A001764(k)/(n-k)!.
From Peter Bala, Mar 13 2025: (Start)
a(n) = hypergeom([-n, 1/3, 2/3], [3/2], -27/4).
2*(2*n + 1)*a(n) = (27*n^2 - 19*n + 4)*a(n-1) - 2*(n - 1)*(27*n - 25)*a(n-2) + 27*(n - 1)*(n - 2)*a(n-3) with a(0) = 0, a(1) = 2 and a(2) = 9. (End)
a(n) ~ 3^(3*n + 1/2) * n^(n + 1/2) / (2^(2*n + 3/2) * exp(n - 4/27) * n^(3/2)). - Vaclav Kotesovec, Mar 14 2025
MAPLE
seq(simplify(hypergeom([-n, 1/3, 2/3], [3/2], -27/4)), n = 0..18); # Peter Bala, Mar 13 2025
MATHEMATICA
Table[HypergeometricPFQ[{-n, 1/3, 2/3}, {3/2}, -27/4], {n, 0, 20}] (* Vaclav Kotesovec, Mar 14 2025 *)
PROG
(PARI) a(n) = n!*sum(k=0, n, binomial(3*k+1, k)/((3*k+1)*(n-k)!));
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 11 2025
STATUS
approved
