A229049 -id:A229049 - cp's OEIS frontend

A229142 Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 7, 13, 1, 1, 1, 25, 115, 63, 1, 1, 1, 121, 2641, 2371, 321, 1, 1, 1, 721, 114121, 392641, 54091, 1683, 1, 1, 1, 5041, 7489441, 169417921, 67982041, 1307377, 8989, 1, 1, 1, 40321, 681120721, 137322405361, 308238414121, 12838867105, 32803219, 48639, 1, 1

Offset: 0

Alois P. Heinz, Sep 23 2013

Column k is the diagonal of the rational function 1 / (1 - Sum_{j=1..k} x_j - Product_{j=1..k} x_j) for k>1. - Seiichi Manyama, Jul 10 2020

			A(1,3) = 3*2+1 = 7:
          (0,1,1)-(0,0,1)
         /       X       \
  (1,1,1)-(1,0,1) (0,1,0)-(0,0,0)
       \ \       X       / /
        \ (1,1,0)-(1,0,0) /
         `---------------´
Square array A(n,k) begins:
  1, 1,    1,       1,           1,               1, ...
  1, 1,    3,       7,          25,             121, ...
  1, 1,   13,     115,        2641,          114121, ...
  1, 1,   63,    2371,      392641,       169417921, ...
  1, 1,  321,   54091,    67982041,    308238414121, ...
  1, 1, 1683, 1307377, 12838867105, 629799991355641, ...

Alois P. Heinz, Antidiagonals n = 0..44, flattened

Columns k=0+1, 2-10 give: A000012, A001850, A081798, A082488, A082489, A229049, A229674, A229675, A229676, A229677.
Rows n=0-1 give: A000012, A038507 (for k>1).
Main diagonal gives: A229267.
Cf. A060854, A227578, A227655, A225094, A210472, A262809, A263159.

with(combinat):
A:= (n,k)-> `if`(k<2, 1, add(multinomial(n+(k-1)*j, n-j, j$k), j=0..n)):
seq(seq(A(n, d-n), n=0..d), d=0..10);

a[, 0] = a[, 1] = 1; a[n_, k_] := Sum[Product[Binomial[n+j*m, m], {j, 0, k-1}], {m, 0, n}]; Table[a[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Dec 11 2013 *)

A(n,k) = Sum_{j=0..n} multinomial(n+(k-1)*j; n-j, {j}^k) for k>1, A(n,0) = A(n,1) = 1.

G.f. of column k: Sum_{j>=0} (k*j)!/j!^k * x^j / (1-x)^(k*j+1). for k>1. - Seiichi Manyama, Jul 10 2020

A081798 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k).

Original entry on oeis.org

1, 7, 115, 2371, 54091, 1307377, 32803219, 844910395, 22188235867, 591446519797, 15953338537885, 434479441772845, 11927609772412075, 329653844941016785, 9163407745486783435, 255982736410338609931, 7181987671728091545787

Offset: 0

Emanuele Munarini, Apr 23 2003

a(n) is also a generalization of Delannoy numbers to 3D; i.e. the number of walks from (0,0,0) to (n,n,n) in a 3D square lattice where each step is in the direction of one of (1,0,0), (0,1,0), (0,0,1) and (1,1,1). - Theodore Kolokolnikov, Jul 04 2010

Diagonal of the rational function 1/(1 - x - y - z - x*y*z). - Gheorghe Coserea, Jul 06 2016

Alois P. Heinz, Table of n, a(n) for n = 0..500
A. Bostan, S. Boukraa, J.-M. Maillard, J.-A. Weil, Diagonals of rational functions and selected differential Galois groups, arXiv preprint arXiv:1507.03227 [math-ph], 2015.
E. W. Weisstein, in MathWorld: Multinomial Coefficient.
Jacques-Arthur Weil, Supplementary Material for the Paper "Diagonals of rational functions and selected differential Galois groups"

Column k = 3 of A229142. Cf. A001850, A082488, A082459, A229049, A229674, A229675, A229676, A229677.

Related to diagonal of rational functions: A268545-A268555.

w := proc(i,j,k) option remember; if i=0 and j=0 and k = 0 then 1; elif i<0 or j<0 or k<0 then 0 else w(i-1,j,k)+w(i,j-1,k)+w(i,j,k-1)+w(i-1,j-1,k-1); end: end: for k from 0 to 10 do lprint(w(k,k,k)):end: # Theodore Kolokolnikov, Jul 04 2010
# second Maple program:
a:= proc(n) option remember; `if`(n<3, 51*n^2-45*n+1,
     ((3*n-2)*(30*n^2-50*n+13)*a(n-1)+(3*n-1)*(n-2)^2*a(n-3)
     -(9*n^3-30*n^2+29*n-6)*a(n-2))/(n^2*(3*n-4)))
    end:
seq(a(n), n=0..20); # Alois P. Heinz, Sep 22 2013

f[n_] := Sum[ Binomial[n, k] Binomial[n + k, k] Binomial[n + 2k, k], {k, 0, n}]; Array[f, 17, 0] (* Robert G. Wilson v *)
CoefficientList[Series[HypergeometricPFQ[{1/3, 2/3}, {1}, 27*x/(1 - x)^3]/(1 - x), {x, 0, 20}], x] (* Vaclav Kotesovec, Jul 07 2016 *)

makelist(sum(binomial(n,k)*binomial(n+k,k)*binomial(n+2*k,k),k,0,n),n,0,12);

{a(n)=polcoeff(sum(m=0,n,(3*m)!/m!^3*x^m/(1-x+x*O(x^n))^(3*m+1)), n)} \\ Paul D. Hanna, Sep 22 2013

a(n) = sum(k = 0, n, binomial(n, k) * binomial(n+k, k) * binomial(n+2*k, k)); \\ Michel Marcus, Jan 14 2016

a(n) = w(n,n,n) where w(i,j,k)=w(i-1,j,k)+w(i,j-1,k)+w(i,j,k-1)+w(i-1,j-1,k-1) and where w(0,0,0)=1 and w(i,j,k)=0 if one of i,j,k is strictly negative. - Theodore Kolokolnikov, Jul 04 2010
G.f.: hypergeom([1/3, 2/3],[1],27*x/(1-x)^3)/(1-x). - Mark van Hoeij, Oct 24 2011
G.f.: Sum_{n>=0} (3*n)!/n!^3 * x^n / (1-x)^(3*n+1). - Paul D. Hanna, Sep 22 2013
a(n) ~ c*d^n/(Pi*n), where d = (3*(292 + 4*sqrt(5))^(2/3) + 132 + 20*(292 + 4*sqrt(5))^(1/3)) / (2*(292 + 4*sqrt(5))^(1/3)) = 29.900786688498085... is the root of the equation -1 + 3*d - 30*d^2 + d^3 = 0 and c = 1/(2*sqrt(((81 - 27*sqrt(5))/2)^(1/3) + 3*((3 + sqrt(5))/2)^(1/3) - 6)) = 0.8959908650405192232... is the root of the equation -1 - 72*c^2 - 1296*c^4 + 1728*c^6 = 0. - Vaclav Kotesovec, Sep 23 2013, updated Jul 07 2016
From Peter Bala, Jan 13 2016: (Start)
a(n) = Sum_{k = 0..n} multinomial(n + 2*k, k, k, k, n - k). Cf. A001850(n) = Sum_{k = 0..n} multinomial(n + k, k, k, n - k).
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 4*x^2 + 42*x^3 + 639*x^4 + 11571*x^5  + ... appears to have integer coefficients. (End)
Conjecture: n^2*(3*n-4)*a(n) -(3*n-2)*(30*n^2-50*n+13)*a(n-1) +(9*n^3-30*n^2+29*n-6)*a(n-2) -(3*n-1)*(n-2)^2*a(n-3)=0. - R. J. Mathar, Apr 15 2016
Conjecture: (n^2)*a(n) +(-28*n^2+24*n-3)*a(n-1) +3*(-19*n^2+78*n-77)*a(n-2) +(5*n-12)*(n-3)*a(n-3) -2*(n-3)^2*a(n-4)=0. - R. J. Mathar, Apr 15 2016
0 = (2*x+1)*(x^3-3*x^2+30*x-1)*x*y'' + (6*x^4-8*x^3+51*x^2+60*x-1)*y' + (x-1)*(2*x^2+2*x-7)*y, where y is g.f. - Gheorghe Coserea, Jul 06 2016

A082488 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3*k,k).

Original entry on oeis.org

1, 25, 2641, 392641, 67982041, 12838867105, 2564949195985, 533008982952625, 114035552691160585, 24950692835328410305, 5557138347370070346601, 1255741805437716400557625, 287180884347761929741524361, 66343186345544102086872515761

Offset: 0

Emanuele Munarini, Apr 28 2003

Diagonal of the rational function 1/(1-(x + y + z + w + x*y*z*w)). - Gheorghe Coserea, Jul 15 2016

			G.f.: A(x) = 1 + 25*x + 2641*x^2 + 392641*x^3 + 67982041*x^4 + 12838867105*x^5 +...
where
A(x) = 1/(1-x) + (4!/1!^4)*x/(1-x)^5 + (8!/2!^4)*x^2/(1-x)^9 + (12!/3!^4)*x^3/(1-x)^13 + (16!/4!^4)*x^4/(1-x)^17 + (20!/5!^4)*x^5/(1-x)^21 +... [Hanna]
Equivalently,
A(x) = 1/(1-x) + 24*x/(1-x)^5 + 2520*x^2/(1-x)^9 + 369600*x^3/(1-x)^13 + 63063000*x^4/(1-x)^17 + 11732745024*x^5/(1-x)^21 +...+ A008977(n)*x^n/(1-x)^(4*n+1) +...

Alois P. Heinz, Table of n, a(n) for n = 0..400
A. Bostan, S. Boukraa, J.-M. Maillard, J.-A. Weil, Diagonals of rational functions and selected differential Galois groups, arXiv preprint arXiv:1507.03227 [math-ph], 2015.
Jacques-Arthur Weil, Supplementary Material for the Paper "Diagonals of rational functions and selected differential Galois groups"

Cf. A081798.
Column k = 4 of A229142.
Cf. A008977, A001850, A082489, A229049, A229050.
Related to diagonal of rational functions: A268545-A268555.

[&+[Binomial(n, k)*Binomial(n+k, k)*Binomial(n+2*k, k)*Binomial(n+3*k, k): k in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Oct 16 2018

with(combinat):
a:= n-> add(multinomial(n+3*k, n-k, k$4), k=0..n):
seq(a(n), n=0..15);  # Alois P. Heinz, Sep 23 2013

Table[Sum[Binomial[n,k]*Binomial[n+k,k]*Binomial[n+2*k,k]* Binomial[n+3*k,k], {k, 0, n}],{n,0,20}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (4*m)!/m!^4*x^m/(1-x+x*O(x^n))^(4*m+1)), n)}
for(n=0, 15, print1(a(n), ", "))

{a(n)=sum(k=0, n, binomial(n, k)*binomial(n+k, k)*binomial(n+2*k, k)*binomial(n+3*k, k))}
for(n=0, 15, print1(a(n), ", "))

G.f.: Sum_{n>=0} (4*n)!/n!^4 * x^n / (1-x)^(4*n+1). - Paul D. Hanna, Sep 22 2013
Recurrence: n^3*(2*n-3)*(4*n-9)*(4*n-5)*a(n) = (4*n-9)*(4*n-3)*(520*n^4 - 1820*n^3 + 2109*n^2 - 905*n + 121)*a(n-1) - (192*n^6 - 1536*n^5 + 4748*n^4 - 7050*n^3 + 5065*n^2 - 1563*n + 171)*a(n-2) + (4*n-1)*(32*n^5 - 296*n^4 + 1040*n^3 - 1689*n^2 + 1209*n - 279)*a(n-3) - (n-3)^3*(2*n-1)*(4*n-5)*(4*n-1)*a(n-4). - Vaclav Kotesovec, Sep 23 2013
a(n) ~ c*d^n/(Pi^(3/2)*n^(3/2)), where d = 65 + 46*sqrt(2) + 2*sqrt(2*(1055 + 746*sqrt(2))) = 259.976980158726979... is the maximal positive root of the equation 1 - 4*d + 6*d^2 - 260*d^3 + d^4 = 0 and c = sqrt(8 + 5*sqrt(2) + sqrt(14*(11 + 8*sqrt(2))))/8 = 0.71529801573844067904424114047445568721... - Vaclav Kotesovec, Sep 23 2013, updated Jul 16 2016
G.f.: hypergeom([1/8, 3/8],[1],256*x/(1-x)^4)^2/(1-x). - Mark van Hoeij, Sep 23 2013
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 13*x^2 + 893*x^3 + 99125*x^4 + 13706093*x^5 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016
0 = x^2*(3*x+1)^2*(1-260*x+6*x^2-4*x^3+x^4)*y''' + 3*x*(3*x+1)*(1-390*x-378*x^2+8*x^3-15*x^4+6*x^5)*y'' + (1-836*x+133*x^2+768*x^3-69*x^4-60*x^5+63*x^6)*y' + (-25+397*x-378*x^2-6*x^3+3*x^4+9*x^5)*y, where y is the g.f. - Gheorghe Coserea, Jul 15 2016

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3k,k) C(n+4*k,k).

Original entry on oeis.org

1, 121, 114121, 169417921, 308238414121, 629799991355641, 1387152264043496161, 3220175519103433952161, 7771784978946238318454761, 19326687177288750280293146161, 49215884415076728067274047737961, 127771596843320597524806463425540481

Offset: 0

Emanuele Munarini, Apr 28 2003

Diagonal of the rational function 1 / (1 - x - y - z - u - v - x*y*z*u*v). - Ilya Gutkovskiy, Apr 22 2025

			G.f.: A(x) = 1 + 121*x + 114121*x^2 + 169417921*x^3 + 308238414121*x^4 +...
where
A(x) = 1/(1-x) + (5!/1!^5)*x/(1-x)^6 + (10!/2!^5)*x^2/(1-x)^11 + (15!/3!^5)*x^3/(1-x)^16 + (20!/4!^5)*x^4/(1-x)^21 + (25!/5!^5)*x^5/(1-x)^26 +... [Hanna]
Equivalently,
A(x) = 1/(1-x) + 120*x/(1-x)^6 + 113400*x^2/(1-x)^11 + 168168000*x^3/(1-x)^16 + 305540235000*x^4/(1-x)^21 + 623360743125120*x^5/(1-x)^26 +...+ A008978(n)*x^n/(1-x)^(5*n+1) +...

Alois P. Heinz, Table of n, a(n) for n = 0..200

Column k = 5 of A229142.

Cf. A008978, A001850, A081798, A082488, A229049, A229050.

with(combinat):
a:= n-> add(multinomial(n+4*k, n-k, k$5), k=0..n):
seq(a(n), n=0..15);  # Alois P. Heinz, Sep 23 2013

Table[Sum[Binomial[n,k]*Binomial[n+k,k]*Binomial[n+2*k,k]* Binomial[n+3*k,k]*Binomial[n+4*k,k], {k, 0, n}],{n,0,20}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (5*m)!/m!^5*x^m/(1-x+x*O(x^n))^(5*m+1)), n)}
for(n=0, 15, print1(a(n), ", ")) \\ Paul D. Hanna, Sep 22 2013

{a(n)=sum(k=0, n, binomial(n, k)*binomial(n+k, k)*binomial(n+2*k, k) *binomial(n+3*k, k)*binomial(n+4*k, k))}
for(n=0, 15, print1(a(n), ", ")) \\ Paul D. Hanna, Sep 22 2013

G.f.: Sum_{n>=0} (5*n)!/n!^5 * x^n / (1-x)^(5*n+1). - Paul D. Hanna, Sep 22 2013
Recurrence: n^4*(5*n-16)*(5*n-12)*(5*n-11)*(5*n-8)*(5*n-7)*(5*n-6)*a(n) = (5*n-16)*(5*n-12)*(5*n-11)*(5*n-4)*(78250*n^6 - 422550*n^5 + 885665*n^4 - 906704*n^3 + 468906*n^2 - 114379*n + 10086)*a(n-1) - (5*n-16)*(31250*n^9 - 400000*n^8 + 2154375*n^7 - 6337750*n^6 + 11073100*n^5 - 11721380*n^4 + 7379043*n^3 - 2629646*n^2 + 489456*n - 36000)*a(n-2) + (5*n-1)*(31250*n^9 - 556250*n^8 + 4241875*n^7 - 18056500*n^6 + 46858025*n^5 - 76033760*n^4 + 76116292*n^3 - 44628880*n^2 + 13702848*n - 1693440)*a(n-3) - (5*n-6)*(5*n-2)*(5*n-1)*(625*n^7 - 11375*n^6 + 86025*n^5 - 347305*n^4 + 798274*n^3 - 1025292*n^2 + 661408*n - 156480)*a(n-4) + (n-4)^4*(5*n-11)*(5*n-7)*(5*n-6)*(5*n-3)*(5*n-2)*(5*n-1)*a(n-5). - Vaclav Kotesovec, Sep 23 2013
a(n) ~ c*d^n/n^2, where d = 3129.996806129131084... is the root of the equation -1 + 5*d - 10*d^2 + 10*d^3 - 3130*d^4 +d^5 = 0 and c = 0.05674890286773483081841276583916042181... - Vaclav Kotesovec, Sep 23 2013
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 61*x^2 + 38101*x^3 + 42394381*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

A229050 G.f.: Sum_{n>=0} (n^2)!/n!^n * x^n / (1-x)^(n^2+1).

Original entry on oeis.org

1, 2, 9, 1714, 63079895, 623361815288736, 2670177752844538217570947, 7363615666255986180456959666126927684, 18165723931631174937747337664794705661513150850379149, 53130688706387570972824498004857476332107293478561950967662962585645710

Offset: 0

Paul D. Hanna, Sep 22 2013

nonn

			G.f.: A(x) = 1 + 2*x + 9*x^2 + 1714*x^3 + 63079895*x^4 + 623361815288736*x^5 +...
where
A(x) = 1/(1-x) + x/(1-x)^2 + (4!/2!^2)*x^2/(1-x)^5 + (9!/3!^3)*x^3/(1-x)^10 + (16!/4!^4)*x^4/(1-x)^17 + (25!/5!^5)*x^5/(1-x)^26 +...
Equivalently,
A(x) = 1/(1-x) + x/(1-x)^2 + 6*x^2/(1-x)^5 + 1680*x^3/(1-x)^10 + 63063000*x^4/(1-x)^17 + 623360743125120*x^5/(1-x)^26 +...+ A034841(n)*x^n/(1-x)^(n^2+1) +...
Illustrate formula a(n) = Sum_{k=0..n} Product_{j=0..k-1} C(n+j*k,k) for initial terms:
a(0) = 1;
a(1) = 1 + C(1,1);
a(2) = 1 + C(2,1) + C(2,2)*C(4,2);
a(3) = 1 + C(3,1) + C(3,2)*C(5,2) + C(3,3)*C(6,3)*C(9,3);
a(4) = 1 + C(4,1) + C(4,2)*C(6,2) + C(4,3)*C(7,3)*C(10,3) + C(4,4)*C(8,4)*C(12,4)*C(16,4);
a(5) = 1 + C(5,1) + C(5,2)*C(7,2) + C(5,3)*C(8,3)*C(11,3) + C(5,4)*C(9,4)*C(13,4)*C(17,4) + C(5,5)*C(10,5)*C(15,5)*C(20,5)*C(25,5); ...
which numerically equals:
a(0) = 1;
a(1) = 1 + 1 = 2;
a(2) = 1 + 2 + 1*6 = 9;
a(3) = 1 + 3 + 3*10 + 1*20*84 = 1714;
a(4) = 1 + 4 + 6*15 + 4*35*120 + 1*70*495*1820 = 63079895;
a(5) = 1 + 5 + 10*21 + 10*56*165 + 5*126*715*2380 + 1*252*3003*15504*53130 = 623361815288736; ...

Alois P. Heinz, Table of n, a(n) for n = 0..26

Cf. A229051, A034841; A001850, A081798, A082488, A082489, A229049.

with(combinat):
a:= n-> add(multinomial(n+(k-1)*k, n-k, k$k), k=0..n):
seq(a(n), n=0..15);  # Alois P. Heinz, Sep 23 2013

Table[Sum[Product[Binomial[n+j*k,k],{j,0,k-1}],{k,0,n}],{n,0,10}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (m^2)!/m!^m*x^m/(1-x+x*O(x^n))^(m^2+1)), n)}
for(n=0,15,print1(a(n),", "))

{a(n)=sum(k=0,n,prod(j=0,k-1,binomial(n+j*k,k)))}
for(n=0,15,print1(a(n),", "))

a(n) = Sum_{k=0..n} Product_{j=0..k-1} binomial(n+j*k,k).

a(n) ~ exp(-1/12) * n^(n^2-n/2+1) / (2*Pi)^((n-1)/2). - Vaclav Kotesovec, Sep 23 2013

A229051 G.f.: Sum_{n>=0} (n^2)!/n!^n * (2*x)^n / (1-x)^(n^2+1).

Original entry on oeis.org

1, 3, 29, 13567, 1009142769, 19947560933879891, 170891375663413844489045533, 942542805274443250197129297402029958879, 4650425326497533656923054675764068523027405525255181377, 27202912617670436035808496756146798219927348043651854025145948950565355779

Offset: 0

Paul D. Hanna, Sep 22 2013

nonn

			G.f.: A(x) = 1 + 3*x + 29*x^2 + 13567*x^3 + 1009142769*x^4 +...
where
A(x) = 1/(1-x) + (2*x)/(1-x)^2 + (4!/2!^2)*(2*x)^2/(1-x)^5 + (9!/3!^3)*(2*x)^3/(1-x)^10 + (16!/4!^4)*(2*x)^4/(1-x)^17 + (25!/5!^5)*(2*x)^5/(1-x)^26 +...
Equivalently,
A(x) = 1/(1-x) + (2*x)/(1-x)^2 + 6*(2*x)^2/(1-x)^5 + 1680*(2*x)^3/(1-x)^10 + 63063000*(2*x)^4/(1-x)^17 + 623360743125120*(2*x)^5/(1-x)^26 +...+ A034841(n)*(2*x)^n/(1-x)^(n^2+1) +...
Illustrate formula a(n) = Sum_{k=0..n} 2^k * Product_{j=0..k-1} C(n+j*k,k) for initial terms:
a(0) = 1;
a(1) = 1 + 2*C(1,1);
a(2) = 1 + 2*C(2,1) + 4*C(2,2)*C(4,2);
a(3) = 1 + 2*C(3,1) + 4*C(3,2)*C(5,2) + 8*C(3,3)*C(6,3)*C(9,3);
a(4) = 1 + 2*C(4,1) + 4*C(4,2)*C(6,2) + 8*C(4,3)*C(7,3)*C(10,3) + 16*C(4,4)*C(8,4)*C(12,4)*C(16,4);
a(5) = 1 + 2*C(5,1) + 4*C(5,2)*C(7,2) + 8*C(5,3)*C(8,3)*C(11,3) + 16*C(5,4)*C(9,4)*C(13,4)*C(17,4) + 32*C(5,5)*C(10,5)*C(15,5)*C(20,5)*C(25,5); ...
which numerically equals:
a(0) = 1;
a(1) = 1 + 2*1 = 3;
a(2) = 1 + 2*2 + 4*1*6 = 29;
a(3) = 1 + 2*3 + 4*3*10 + 8*1*20*84 = 13567;
a(4) = 1 + 2*4 + 4*6*15 + 8*4*35*120 + 16*1*70*495*1820 = 1009142769;
a(5) = 1 + 2*5 + 4*10*21 + 8*10*56*165 + 16*5*126*715*2380 + 32*1*252*3003*15504*53130 = 19947560933879891; ...

Alois P. Heinz, Table of n, a(n) for n = 0..26

Cf. A229050, A034841; A001850, A081798, A082488, A082489, A229049.

with(combinat):
a:= n-> add(2^k*multinomial(n+(k-1)*k, n-k, k$k), k=0..n):
seq(a(n), n=0..10);  # Alois P. Heinz, Sep 23 2013

Table[Sum[2^k*Product[Binomial[n+j*k,k],{j,0,k-1}],{k,0,n}],{n,0,10}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (m^2)!/m!^m*(2*x)^m/(1-x+x*O(x^n))^(m^2+1)), n)}
for(n=0,15,print1(a(n),", "))

{a(n)=sum(k=0,n,2^k*prod(j=0,k-1,binomial(n+j*k,k)))}
for(n=0,15,print1(a(n),", "))

a(n) = Sum_{k=0..n} 2^k * Product_{j=0..k-1} binomial(n+j*k,k).

a(n) ~ exp(-1/12) * n^(n^2-n/2+1) * 2^n / (2*Pi)^((n-1)/2). - Vaclav Kotesovec, Sep 23 2013

cp's OEIS Frontend

A229142 Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A081798 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

PARI

Formula

A082488 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

End

Magma

Maple

Mathematica

PARI

PARI

Formula

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k) * C(n+4*k,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A229050 G.f.: Sum_{n>=0} (n^2)!/n!^n * x^n / (1-x)^(n^2+1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A229051 G.f.: Sum_{n>=0} (n^2)!/n!^n * (2*x)^n / (1-x)^(n^2+1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A082488 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3*k,k).

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3k,k) C(n+4*k,k).