OFFSET
0,2
COMMENTS
The sequences A(n,k) = Sum_{j=0..n} Sum_{i=0..j} (-1)^(j-i) * binomial(n,j) * binomial(j,i) * binomial(j+k+(k+1)*i,j+k) are C-sequences for fixed integer k, here A(n,k=3) = a(n).
LINKS
Winston de Greef, Table of n, a(n) for n = 0..1408
Project Euler, Problem 831. Triple Product
Index entries for linear recurrences with constant coefficients, signature (20,-150,500,-625).
FORMULA
G.f.: (1 + 50*x - 75*x^2) / (5*x - 1)^4.
a(n) = 20*a(n-1) -150*a(n-2) +500*a(n-3) -625*a(n-4).
D-finite with recurrence n*(4*n^2+6*n-7)*a(n) -5*(n+1)*(4*n^2+14*n+3)*a(n-1)=0.
MATHEMATICA
LinearRecurrence[{20, -150, 500, -625}, {1, 70, 1175, 13500}, 30] (* Harvey P. Dale, Aug 29 2024 *)
PROG
(Python)
def A361610(n): return 5**n*(n*(n*(4*n + 18) + 17) + 3)//3 # Chai Wah Wu, Mar 17 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. J. Mathar, Mar 17 2023
STATUS
approved