A279127 a(n) = Sum_{0<=m<n} Product_{-m<=j<=m} (n-j).

0, 1, 8, 147, 5824, 405845, 43733976, 6726601063, 1398047697152, 377278848390249, 128228860181918440, 53585748788874537851, 27001973543813627400768, 16144773936121968789213757, 11300021011239061076228900024, 9152162639827097780662174019535

Offset

0,3

Comments

n-m | a(n)-a(m) for all n,m.

Links

Robert Israel, Table of n, a(n) for n = 0..225

Math StackExchange, Are certain integer functions well-defined modulo different primes necessarily polynomials?

Formula

a(n) = A003470(2n-1) for n >= 1.

a(n) = n*hypergeom([1,n+1,1-n],[],-1).

a(n+3) = -a(n)+(4*n^2+6*n-1)*a(n+1)+(4*n^2+18*n+17)*a(n+2)+8*n+12.

D-finite with recurrence +(-2*n+5)*a(n) +(2*n-5)*(4*n^2-6*n+1)*a(n-1) -(2*n-1)*(4*n^2-18*n+19)*a(n-2) +(2*n-1)*a(n-3)=0. - R. J. Mathar, Jul 27 2022

Maple

f:= n -> add(mul(n-m, m=-k..k), k=0..n):
map(f, [$0..40]);

Mathematica

Table[Sum[Product[n - j, {j, -m, m}], {m, 0, n}], {n, 0, 25}] (* G. C. Greubel, Dec 07 2016 *)

Prog

(PARI) a(n) = sum(m=0, n-1, prod(j=-m, m, n-j)); \\ Michel Marcus, Dec 07 2016

Crossrefs

Cf. A003470.

Sequence in context: A351922 A239758 A239759 * A259991 A212732 A220297

Adjacent sequences: A279124 A279125 A279126 * A279128 A279129 A279130

Keyword

nonn

Author

Robert Israel, Dec 06 2016

Status

approved