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 5 the sequence becomes [1, 2, 1, 0, 1, 1, 2, 1, 0, 1, ...] with period 5. In particular, a(5*n+3) == 0 (mod 5). Cf. A047974. - Peter Bala, Mar 13 2025
FORMULA
a(n) = n! * Sum_{k=0..n} A002293(k)/(n-k)!.
From Peter Bala, Mar 13 2025: (Start)
a(n) = hypergeom([-n, 1/2, 1/4, 3/4], [2/3, 4/3], -256/27).
3*(3*n - 1)*(3*n + 1)*a(n) = n*(256*n^2 - 303*n + 95)*a(n-1) - 3*(n - 1)*(256*n^2 - 485*n + 245)*a(n-2) + 3*(256*n - 375)*(n - 1)*(n - 2)*a(n-3) - 256*(n - 1)*(n - 2)*(n - 3)*a(n-4) with a(0) = 1, a(1) = 2, a(2) = 11 and a(3) = 160. (End)
a(n) ~ 2^(8*n+1) * n^(n-1) / (3^(3*n + 3/2) * exp(n - 27/256)). - Vaclav Kotesovec, Mar 14 2025
MAPLE
seq(simplify(hypergeom([-n, 1/2, 1/4, 3/4], [2/3, 4/3], -256/27)), n = 0..17); # Peter Bala, Mar 13 2025
MATHEMATICA
Table[HypergeometricPFQ[{-n, 1/2, 1/4, 3/4}, {2/3, 4/3}, -256/27], {n, 0, 20}] (* Vaclav Kotesovec, Mar 14 2025 *)
PROG
(PARI) a(n) = n!*sum(k=0, n, binomial(4*k+1, k)/((4*k+1)*(n-k)!));
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 12 2025
STATUS
approved
