OFFSET
0,6
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n-1+k,k) * binomial(n,5*k).
Recurrence: 125*(n-3)*(n-2)*(n-1)*n*(2*n - 7)*(3*n - 11)*(3*n - 8)*(6*n - 23)*(6*n - 17)*(6*n - 11)*a(n) = -50*(n-3)*(n-2)*(n-1)*(3*n - 11)*(6*n - 23)*(6*n - 17)*(576*n^4 - 4896*n^3 + 14402*n^2 - 16875*n + 6250)*a(n-1) - 30*(n-3)*(n-2)*(6*n - 23)*(6*n - 5)*(7884*n^6 - 123516*n^5 + 791601*n^4 - 2652565*n^3 + 4894096*n^2 - 4707500*n + 1842500)*a(n-2) - 2*(n-3)*(3*n - 5)*(6*n - 11)*(6*n - 5)*(60192*n^6 - 1113552*n^5 + 8528546*n^4 - 34608379*n^3 + 78470893*n^2 - 94255700*n + 46855500)*a(n-3) - 5*(2*n - 5)*(3*n - 8)*(3*n - 5)*(5*n - 19)*(5*n - 18)*(5*n - 17)*(5*n - 16)*(6*n - 17)*(6*n - 11)*(6*n - 5)*a(n-4). - Vaclav Kotesovec, Mar 18 2023
From Peter Bala, Apr 16 2023: (Start)
a(n) = (-1)^n*hypergeom([-n/5, 1/5 - n/5, 2/5 - n/5, 3/5 - n/5, 4/5 - n/5, n], [1/5, 2/5, 3/5, 4/5, 1], 1).
Conjecture: the supercongruence a(n*p^r) == a(n*p^(r-1)) (mod p^(2*r)) holds for positive integers n and r and all primes p >= 3. (End)
MAPLE
a := n -> (-1)^n*hypergeom([-n/5, 1/5 - n/5, 2/5 - n/5, 3/5 - n/5, 4/5 - n/5, n], [1/5, 2/5, 3/5, 4/5, 1], 1): seq(simplify(a(n)), n = 0..30); # Peter Bala, Apr 16 2023
MATHEMATICA
a[n_] := Coefficient[Series[1/(1 + x + x^2 + x^3 + x^4)^n, {x, 0, n}], x, n]; Array[a, 30, 0] (* Amiram Eldar, Dec 29 2021 *)
PROG
(PARI) a(n) = sum(k=0, n, (-1)^(n-k)*binomial(n-1+k, k)*binomial(n, 5*k));
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Seiichi Manyama, Dec 29 2021
STATUS
approved