A229142 -id:A229142 - cp's OEIS frontend

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

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 13, 13, 1, 1, 1, 75, 409, 63, 1, 1, 1, 541, 23917, 16081, 321, 1, 1, 1, 4683, 2244361, 10681263, 699121, 1683, 1, 1, 1, 47293, 308682013, 14638956721, 5552351121, 32193253, 8989, 1, 1, 1, 545835, 58514835289, 35941784497263, 117029959485121, 3147728203035, 1538743249, 48639, 1, 1

Offset: 0

Alois P. Heinz, Oct 02 2015

Also, A(n,k) is the number of alignments for k sequences of length n each (Slowinski 1998).
Row r > 0 is asymptotic to sqrt(r*Pi) * (r^(r-1)/(r-1)!)^n * n^(r*n+1/2) / (2^(r/2) * exp(r*n) * (log(2))^(r*n+1)), or equivalently to sqrt(r) * (r^(r-1)/(r-1)!)^n * (n!)^r / (2^r * (Pi*n)^((r-1)/2) * (log(2))^(r*n+1)). - Vaclav Kotesovec, Mar 23 2016
From Vaclav Kotesovec, Mar 23 2016: (Start)
Column k > 0 is asymptotic to sqrt(c(k)) * d(k)^n / (Pi*n)^((k-1)/2), where c(k) and d(k) are roots of polynomial equations of degree k, independent on n.
---------------------------------------------------
k               d(k)
---------------------------------------------------
2              5.8284271247461900976033774484193...
3             56.9476283720414911685286267804411...
4            780.2794068067951456595241495989622...
5          13755.2719024115081712083954421541320...
6         296476.9162644200814909862281498491264...
7        7553550.6198338218721069097516499501996...
8      222082591.6017202421029000117685530884167...
9     7400694480.0494436216324852038000444393262...
10  275651917450.6709238286995776605620357737005...
---------------------------------------------------
d(k) is a root of polynomial:
---------------------------------------------------
k=2, 1 - 6*d + d^2
k=3, -1 + 3*d - 57*d^2 + d^3
k=4, 1 - 12*d - 218*d^2 - 780*d^3 + d^4
k=5, -1 + 5*d - 1260*d^2 - 3740*d^3 - 13755*d^4 + d^5
k=6, 1 - 18*d - 5397*d^2 - 123696*d^3 + 321303*d^4 - 296478*d^5 + d^6
k=7, -1 + 7*d - 24031*d^2 - 374521*d^3 - 24850385*d^4 + 17978709*d^5 - 7553553*d^6 + d^7
k=8, 1 - 24*d - 102692*d^2 - 9298344*d^3 + 536208070*d^4 - 7106080680*d^5 - 1688209700*d^6 - 222082584*d^7 + d^8
(End)
d(k) = (2^(1/k) - 1)^(-k). - David Bevan, Apr 07 2022
d(k) is asymptotic to (k/log(2))^k/sqrt(2). - David Bevan, Apr 07 2022
A(n,k) is the number of binary matrices with k columns and any number of nonzero rows with n ones in every column. - Andrew Howroyd, Jan 23 2020

			A(2,2) = 13: [(2,2),(1,2),(0,2),(0,1),(0,0)], [(2,2),(1,2),(0,1),(0,0)], [(2,2),(1,2),(1,1),(0,1),(0,0)], [(2,2),(1,2),(1,1),(0,0)], [(2,2),(1,2),(1,1),(1,0),(0,0)], [(2,2),(2,1),(1,1),(0,1),(0,0)], [(2,2),(2,1),(1,1),(0,0)], [(2,2),(2,1),(1,1),(1,0),(0,0)], [(2,2),(2,1),(2,0),(0,1),(0,0)], [(2,2),(2,1),(1,0),(0,0)], [(2,2),(1,1),(0,1),(0,0)], [(2,2),(1,1),(0,0)], [(2,2),(1,1),(1,0),(0,0)].
Square array A(n,k) begins:
  1, 1,    1,        1,             1,                   1, ...
  1, 1,    3,       13,            75,                 541, ...
  1, 1,   13,      409,         23917,             2244361, ...
  1, 1,   63,    16081,      10681263,         14638956721, ...
  1, 1,  321,   699121,    5552351121,     117029959485121, ...
  1, 1, 1683, 32193253, 3147728203035, 1050740615666453461, ...

Alois P. Heinz, Antidiagonals n = 0..48, flattened
J. B. Slowinski, The Number of Multiple Alignments, Molecular Phylogenetics and Evolution 10:2 (1998), 264-266. doi:10.1006/mpev.1998.0522

Columns: A000012 (k=0 and k=1), A001850 (k=2), A126086 (k=3), A263064 (k=4), A263065 (k=5), A263066 (k=6), A263067 (k=7), A263068 (k=8), A263069 (k=9), A263070 (k=10).
Rows: A000012 (n=0), A000670 (n=1), A055203 (n=2), A062208 (n=3), A062205 (n=4), A263061 (n=5), A263062 (n=6), A062204 (n=7), A263063 (n=8), A263071 (n=9), A263072 (n=10).
Main diagonal: A262810.
Cf. A210472, A225094, A227578, A227655, A229142, A229345, A263159, A316674.
Cf. A188392, A330942, A331461, A331637.

A:= (n, k)-> add(add((-1)^i*binomial(j, i)*
     binomial(j-i, n)^k, i=0..j), j=0..k*n):
seq(seq(A(n, d-n), n=0..d), d=0..10);

A[, 0] =  1; A[n, k_] := Sum[Sum[(-1)^i*Binomial[j, i]*Binomial[j - i, n]^k, {i, 0, j}], {j, 0, k*n}];
Table[Table[A[n, d - n], {n, 0, d}], {d, 0, 10}] // Flatten (* Jean-François Alcover, Jul 22 2016, after Alois P. Heinz *)

T(n,k) = {my(m=n*k); sum(j=0, m, binomial(j,n)^k*sum(i=j, m, (-1)^(i-j)*binomial(i, j)))} \\ Andrew Howroyd, Jan 23 2020

A(n,k) = Sum_{j=0..k*n} Sum_{i=0..j} (-1)^i*C(j,i)*C(j-i,n)^k.
A(n,k) = Sum_{i >= 0} binomial(i,n)^k/2^(i+1). - Peter Bala, Jan 30 2018
A(n,k) = Sum_{j=0..n*k} binomial(j,n)^k * Sum_{i=j..n*k} (-1)^(i-j) * binomial(i,j). - Andrew Howroyd, Jan 23 2020

A263159 Number A(n,k) of lattice paths starting at {n}^k and ending when k or any component equals 0, using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 7, 13, 1, 1, 1, 15, 157, 63, 1, 1, 1, 31, 2101, 5419, 321, 1, 1, 1, 63, 32461, 717795, 220561, 1683, 1, 1, 1, 127, 580693, 142090291, 328504401, 9763807, 8989, 1, 1, 1, 255, 11917837, 39991899123, 944362553521, 172924236255, 454635973, 48639, 1, 1

Offset: 0

Alois P. Heinz, Oct 11 2015

			Square array A(n,k) begins:
  1, 1,    1,       1,            1,                1, ...
  1, 1,    3,       7,           15,               31, ...
  1, 1,   13,     157,         2101,            32461, ...
  1, 1,   63,    5419,       717795,        142090291, ...
  1, 1,  321,  220561,    328504401,     944362553521, ...
  1, 1, 1683, 9763807, 172924236255, 7622403922836151, ...

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

Columns k=0+1, 2-10 give: A000012, A001850, A115866, A263162, A263163, A263164, A263165, A263166, A263167, A263168.
Rows n=0-1 give: A000012, A255047.
Main diagonal gives A263160.
Cf. A210472, A225094, A227578, A227655, A229142, A229345, A262809.

s:= proc(n) option remember; `if`(n=0, {[]},
      map(x-> [[x[], 0], [x[], 1]][], s(n-1)))
    end:
b:= proc(l) option remember; `if`(l=[] or l[1]=0, 1,
       add((p-> `if`(p[1]<0, 0, `if`(p[1]=0, 1, b(p)))
       )(sort(l-x)), x=s(nops(l)) minus {[0$nops(l)]}))
    end:
A:= (n, k)-> b([n$k]):
seq(seq(A(n,d-n), n=0..d), d=0..10);

g[k_] := Table[Reverse[IntegerDigits[n, 2]][[;;k]], {n, 2^k+1, 2^(k+1)-1}];
b[l_] := b[l] = If[l[[1]] == 0, 1, Sum[b[Sort[l - h]], {h, g[k]}]];
a[n_, k_] := If[n == 0 || k == 0 || k == 1, 1, b[Table[n, {k}]]];
Table[a[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Apr 25 2020, after Alois P. Heinz in A115866 *)

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.

End

[&+[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

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

Original entry on oeis.org

1, 721, 7489441, 137322405361, 3249278494922881, 88913838899388373921, 2672932604015450235911761, 85821373873727899097881489201, 2892941442791065880984595547275841, 101239016762863657789924022384195015281, 3649717311362112161867915447690005522733041

Offset: 0

Paul D. Hanna, Sep 22 2013

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

			G.f.: A(x) = 1 + 721*x + 7489441*x^2 + 137322405361*x^3 + 3249278494922881*x^4 +...
where
A(x) = 1/(1-x) + (6!/1!^6)*x/(1-x)^7 + (12!/2!^6)*x^2/(1-x)^13 + (18!/3!^6)*x^3/(1-x)^19 + (24!/4!^6)*x^4/(1-x)^25 + (30!/5!^6)*x^5/(1-x)^31 +...
Equivalently,
A(x) = 1/(1-x) + 720*x/(1-x)^7 + 7484400*x^2/(1-x)^13 + 137225088000*x^3/(1-x)^19 + 3246670537110000*x^4/(1-x)^25 + 88832646059788350720*x^5/(1-x)^31 +...+ A008979(n)*x^n/(1-x)^(6*n+1) +...

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

Cf. A008979, A001850, A081798, A082488, A082489, A229050.

Column k = 6 of A229142.

with(combinat):
a:= n-> add(multinomial(n+5*k, n-k, k$6), 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]*Binomial[n+5*k,k], {k, 0, n}],{n,0,20}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (6*m)!/m!^6*x^m/(1-x+x*O(x^n))^(6*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) *binomial(n+4*k,k)*binomial(n+5*k,k))}
for(n=0,15,print1(a(n),", "))

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) * C(n+5*k,k).
Recurrence: n^5*(2*n - 5)*(2*n - 3)*(3*n - 10)*(3*n - 7)*(3*n - 5)*(3*n - 4)*(6*n - 25)*(6*n - 19)*(6*n - 13)*(6*n - 7)*a(n) = (2*n - 5)*(3*n - 10)*(3*n - 7)*(6*n - 25)*(6*n - 19)*(6*n - 13)*(6*n - 5)*(839916*n^8 - 6159384*n^7 + 18804591*n^6 - 30967129*n^5 + 29803190*n^4 - 16984623*n^3 + 5534242*n^2 - 929843*n + 60482)*a(n-1) - (3*n - 10)*(6*n - 25)*(6*n - 19)*(58320*n^12 - 1030320*n^11 + 7973640*n^10 - 35550360*n^9 + 101096973*n^8 - 191892891*n^7 + 247426961*n^6 - 216687345*n^5 + 127127767*n^4 - 48662719*n^3 + 11593839*n^2 - 1535715*n + 84350)*a(n-2) + 10*(6*n - 25)*(6*n - 1)*(23328*n^13 - 618192*n^12 + 7344432*n^11 - 51616440*n^10 + 238504338*n^9 - 761904909*n^8 + 1722993100*n^7 - 2778206390*n^6 + 3175831572*n^5 - 2526793076*n^4 + 1352618106*n^3 - 459806772*n^2 + 89082095*n - 7435050)*a(n-3) - 5*(3*n - 1)*(6*n - 7)*(6*n - 1)*(11664*n^12 - 369360*n^11 + 5235192*n^10 - 43777800*n^9 + 239670873*n^8 - 901183065*n^7 + 2374616540*n^6 - 4392523494*n^5 + 5622136222*n^4 - 4816276070*n^3 + 2596763070*n^2 - 784074950*n + 100205500)*a(n-4) + (2*n - 1)*(3*n - 4)*(3*n - 1)*(6*n - 13)*(6*n - 7)*(6*n - 1)*(648*n^9 - 19548*n^8 + 256338*n^7 - 1909293*n^6 + 8851093*n^5 - 26285080*n^4 + 49492875*n^3 - 56141750*n^2 + 34024625*n - 8063750)*a(n-5) - (n-5)^5*(2*n - 3)*(2*n - 1)*(3*n - 7)*(3*n - 4)*(3*n - 2)*(3*n - 1)*(6*n - 19)*(6*n - 13)*(6*n - 7)*(6*n - 1)*a(n-6). - Vaclav Kotesovec, Sep 23 2013
a(n) ~ c*d^n/(n^(5/2)), where d = 46661.9996785484656481246... is the root of the equation 1 - 6*d + 15*d^2 - 20*d^3 + 15*d^4 - 46662*d^5 + d^6 = 0 and c = 0.024758197509539176365175770882978221... - Vaclav Kotesovec, Sep 23 2013
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 361*x^2 + 2496841*x^3 + 34333162981*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

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

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 7, 22, 4, 1, 1, 25, 248, 188, 8, 1, 1, 121, 6506, 11380, 1712, 16, 1, 1, 721, 292442, 2359348, 577124, 16098, 32, 1, 1, 5041, 19450082, 1088626684, 991365512, 30970588, 154352, 64, 1

Offset: 0

Alois P. Heinz, Sep 24 2013

			A(2,2) = 22: [(2,2),(1,1),(0,0)], [(2,2),(1,1),(0,1),(0,0)], [(2,2),(1,1),(1,0),(0,0)], [(2,2),(0,0)], [(2,2),(1,2),(0,1),(0,0)], [(2,2),(1,2),(0,2),(0,1),(0,0)], [(2,2),(1,2),(0,2),(0,0)], [(2,2),(1,2),(1,1),(0,0)], [(2,2),(1,2),(1,1),(0,1),(0,0)], [(2,2),(1,2),(1,1),(1,0),(0,0)], [(2,2),(1,2),(1,0),(0,0)], [(2,2),(0,2),(0,1),(0,0)], [(2,2),(0,2),(0,0)], [(2,2),(2,1),(1,0),(0,0)], [(2,2),(2,1),(1,1),(0,0)], [(2,2),(2,1),(1,1),(0,1),(0,0)], [(2,2),(2,1),(1,1),(1,0),(0,0)], [(2,2),(2,1),(0,1),(0,0)], [(2,2),(2,1),(2,0),(1,0),(0,0)], [(2,2),(2,1),(2,0),(0,0)], [(2,2),(2,0),(1,0),(0,0)], [(2,2),(2,0),(0,0)].
Square array A(n,k) begins:
  1,  1,     1,        1,            1,                 1, ...
  1,  1,     3,        7,           25,               121, ...
  1,  2,    22,      248,         6506,            292442, ...
  1,  4,   188,    11380,      2359348,        1088626684, ...
  1,  8,  1712,   577124,    991365512,     4943064622568, ...
  1, 16, 16098, 30970588, 453530591824, 25162900228200976, ...

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

Columns k=0-3 give: A000012, A011782, A132595(n+1), A229482.
Rows n=0-2 give: A000012, A038507 (for k>1), A229465.
Main diagonal gives: A229346.
Cf. A060854, A227578, A227655, A225094, A210472, A229142, A262809, A263159.

b:= proc(l) option remember; local m; m:= nops(l);
      `if`(m=0 or l[m]=0, 1,
      `if`(m>1, add(b(l-[j$m]), j=1..l[1]), 0)+
      add(add(b(sort(subsop(i=l[i]-j, l))), j=1..l[i]), i=1..m))
    end:
A:= (n, k)-> b([n$k]):
seq(seq(A(n, d-n), n=0..d), d=0..10);  # Alois P. Heinz, Sep 24 2013

b[l_] := b[l] = With[{m = Length[l]}, If[m == 0 || l[[m]] == 0, 1, If[m > 1, Sum[b[l - Array[j&, m]], {j, 1, l[[1]]}],  0] + Sum[Sum[b[Sort[ReplacePart[l, i -> l[[i]] - j]]], {j, 1, l[[i]]}], {i, 1, m}]]]; a[n_, k_] := b[Array[n&, k]]; Table[Table[a[n, d-n], {n, 0, d}], {d, 0, 10}] // Flatten (* Jean-François Alcover, Dec 16 2013, translated from Maple *)

A229267 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component or all components by 1.

Original entry on oeis.org

1, 1, 13, 2371, 67982041, 629799991355641, 2672932604015450235911761, 7364217994146042440421602767480184881, 18165821273625565354157327818616137066973745155992321, 53130704578476340997304138835621075610747224340706918846011664495415681

Offset: 0

Alois P. Heinz, Sep 23 2013

nonn

			a(2) = 3*3 + 2*2 = 13:
.           (0,2)
.          /     \
.     (1,2)-------(0,1)
.    /     \     /     \
(2,2)-------(1,1)-------(0,0)
.    \     /     \     /
.     (2,1)-------(1,0)
.          \     /
.           (2,0)

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

Main diagonal of A229142.

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

multinomial[n_, k_List] := n!/Times @@ (k!); a[n_] := If[n < 2, 1, Sum[multinomial[n+(n-1)*j, Join[{n-j}, Array[j&, n]]], {j, 0, n}]]; Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Dec 27 2013, translated from Maple *)

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

A229674 a(n) = Sum_{k = 0..n} Product_{j = 0..6} C(n+j*k,k).

Original entry on oeis.org

1, 5041, 681120721, 182519583427441, 66479594535132382801, 28839847393654717358640241, 14008219182384095498700747103921, 7364217994146042440421602767480184881, 4104535666620019954310735707010727096941521, 2392974957158188560683670847243199936518562761441

Offset: 0

Alois P. Heinz, Sep 27 2013

Number of lattice paths from {n}^7 to {0}^7 using steps that decrement one component or all components by 1.

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

Column k = 7 of A229142.

with(combinat):
a:= n-> add(multinomial(n+6*k, n-k, k$7), k=0..n):
seq(a(n), n=0..10);

multinomial[n_, k_List] := n!/Times @@ (k!); a[n_] := Sum[multinomial[n+6*k, Join[{n-k}, Array[k&, 7]]], {k, 0, n}]; Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Dec 27 2013, translated from Maple *)

a(n) = Sum_{k = 0..n} multinomial(n+6*k; n-k, {k}^7).
G.f.: Sum_{k >= 0} (7*k)!/k!^7 * x^k / (1-x)^(7*k+1).
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 2521*x^2 + 227042761*x^3 + 45630126074821*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

A229675 a(n) = Sum_{k = 0..n} Product_{j = 0..7} C(n+j*k,k).

Original entry on oeis.org

1, 40321, 81730010881, 369400348294790401, 2390471064720364776796801, 18975660656355118819906214670721, 171890067585060168829713844899790066561, 1707759022485971054271963683059722310362986881, 18165821273625565354157327818616137066973745155992321

Offset: 0

Alois P. Heinz, Sep 27 2013

Number of lattice paths from {n}^8 to {0}^8 using steps that decrement one component or all components by 1.

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

Column k = 8 of A229142.

with(combinat):
a:= n-> add(multinomial(n+7*k, n-k, k$8), k=0..n):
seq(a(n), n=0..10);

multinomial[n_, k_List] := n!/Times @@ (k!); a[n_] := Sum[multinomial[n + 7*k, Join[{n - k}, Array[k&, 8]]], {k, 0, n}]; Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Dec 27 2013, translated from Maple *)
Table[Sum[Product[Binomial[n+j*k,k],{j,0,7}],{k,0,n}],{n,0,10}] (* Harvey P. Dale, Aug 25 2014 *)

a(n) = Sum_{k = 0..n} multinomial(n+7*k; n-k, {k}^8).
G.f.: Sum_{k >= 0} (8*k)!/k!^8 * x^k / (1-x)^(8*k+1).
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 20161*x^2 + 27243357121*x^3 + 92350114520267521*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A263159 Number A(n,k) of lattice paths starting at {n}^k and ending when k or any component equals 0, using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

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

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

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).

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