A002294 -id:A002294 - cp's OEIS frontend

A213104 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^10)^5.

1, 1, 5, 40, 360, 3820, 43651, 543240, 7146185, 98885725, 1420274645, 21037156031, 319127602075, 4935547265370, 77525696636995, 1233356748777015, 19829269320322346, 321631227310756885, 5255920261950786655, 86436636022328320125, 1429253483704685851315

Offset: 0

Paul D. Hanna, Jun 05 2012

sign

Compare definition of g.f. to:
(1) B(x) = 1 + x/B(-x*B(x)) when B(x) = 1/(1-x).
(2) C(x) = 1 + x/C(-x*C(x)^3)^2 when C(x) = 1 + x*C(x)^2 (A000108).
(3) D(x) = 1 + x/D(-x*D(x)^5)^3 when D(x) = 1 + x*D(x)^3 (A001764).
(4) E(x) = 1 + x/E(-x*E(x)^7)^4 when E(x) = 1 + x*E(x)^4 (A002293).
(5) F(x) = 1 + x/F(-x*F(x)^9)^5 when F(x) = 1 + x*F(x)^5 (A002294).
(6) G(x) = 1 + x/G(-x*G(x)^11)^6 when G(x) = 1 + x*G(x)^6 (A002295).
The first negative term is a(306). - Georg Fischer, Feb 16 2019

			G.f.: A(x) = 1 + x + 5*x^2 + 40*x^3 + 360*x^4 + 3820*x^5 + 43651*x^6 +...
Related expansions:
A(x)^10 = 1 + 10*x + 95*x^2 + 970*x^3 + 10335*x^4 + 116452*x^5 +...
A(-x*A(x)^10)^5 = 1 - 5*x - 15*x^2 - 85*x^3 - 995*x^4 - 10776*x^5 -...

Paul D. Hanna, Table of n, a(n) for n = 0..400

Cf. A000108, A001764, A002293, A002294, A002295, A213091, A213092, A213093, A213094, A213095, A213096, A213098, A213099, A213100, A213101, A213102, A213103, A213105.

m = 21; A[] = 1; Do[A[x] = 1 + x/A[-x A[x]^10]^5 + O[x]^m, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Nov 06 2019 *)

{a(n)=local(A=1+x+x*O(x^n));for(i=1,n,A=1+x/subst(A^5,x,-x*subst(A^10,x,x+x*O(x^n))) );polcoeff(A,n)}
for(n=0,30,print1(a(n),", "))

A349332 G.f. A(x) satisfies A(x) = 1 + x * A(x)^5 / (1 - x).

Original entry on oeis.org

1, 1, 6, 46, 406, 3901, 39627, 418592, 4551672, 50610692, 572807157, 6577068383, 76426719408, 897078662538, 10620634999318, 126676885170703, 1520759193166329, 18361269213121164, 222814883564042704, 2716125963857227904, 33244557641365865109

Offset: 0

Ilya Gutkovskiy, Nov 15 2021

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..897

Cf. A002212, A307678, A349331, A349333, A349334, A349335.

Cf. A002294, A346647 (partial sums), A349361, A364748.

a:= n-> coeff(series(RootOf(1+x*A^5/(1-x)-A, A), x, n+1), x, n):
seq(a(n), n=0..20);  # Alois P. Heinz, Nov 15 2021

nmax = 20; A[] = 0; Do[A[x] = 1 + x A[x]^5/(1 - x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n - 1, k - 1] Binomial[5 k, k]/(4 k + 1), {k, 0, n}], {n, 0, 20}]

{a(n) = my(A=[1]); for(m=1, n, A=concat(A, 0);
A[#A] = 1 + sum(k=1, m-1, (polcoeff(Ser(A)^5, k)) )); A[n+1]}
for(n=0, 30, print1(a(n), ", ")) \\ Vaclav Kotesovec, Nov 23 2024, after Paul D. Hanna

a(n) = Sum_{k=0..n} binomial(n-1,k-1) * binomial(5*k,k) / (4*k+1).
a(n) ~ 3381^(n + 1/2) / (25 * sqrt(Pi) * n^(3/2) * 2^(8*n + 7/2)). - Vaclav Kotesovec, Nov 15 2021
Recurrence: 8*n*(2*n - 1)*(4*n - 1)*(4*n + 1)*a(n) = (4405*n^4 - 10346*n^3 + 9575*n^2 - 4354*n + 840)*a(n-1) - 12*(n-2)*(1255*n^3 - 3957*n^2 + 4492*n - 1820)*a(n-2) + 2*(n-3)*(n-2)*(10655*n^2 - 32733*n + 26908)*a(n-3) - 4*(n-4)*(n-3)*(n-2)*(3445*n - 6986)*a(n-4) + 3381*(n-5)*(n-4)*(n-3)*(n-2)*a(n-5). - Vaclav Kotesovec, Nov 17 2021

A062993 A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 5, 3, 1, 1, 14, 12, 4, 1, 1, 42, 55, 22, 5, 1, 1, 132, 273, 140, 35, 6, 1, 1, 429, 1428, 969, 285, 51, 7, 1, 1, 1430, 7752, 7084, 2530, 506, 70, 8, 1, 1, 4862, 43263, 53820, 23751, 5481, 819, 92, 9

Offset: 0

Wolfdieter Lang, Jul 12 2001

The column sequences (without leading zeros) appear in eq.(7.66), p. 347 of the Graham et al. reference, in Th. 0.3, p. 66, of Hilton and Pedersen reference, as first columns of the S-triangles in the Hoggatt and Bicknell reference and in eq. 5 of the Frey and Sellers reference. They are also called m-Raney (here m=k+2) or Fuss-Catalan sequences (see Graham et al. for reference). For the history and the name Pfaff-Fuss see Brown reference, p. 975. PF(n,m) := binomial(m*n+1,n)/(m*n+1), m >= 2.

Also called generalized Catalan numbers.

			The triangle a(n, k) begins:
n\k     0      1      2      3     4     5    6   7  8  9 10 ...
0:      1
1:      1      1
2:      2      1      1
3:      5      3      1      1
4:     14     12      4      1     1
5:     42     55     22      5     1     1
6:    132    273    140     35     6     1    1
7:    429   1428    969    285    51     7    1   1
8:   1430   7752   7084   2530   506    70    8   1  1
9:   4862  43263  53820  23751  5481   819   92   9  1  1
10: 16796 246675 420732 231880 62832 10472 1240 117 10  1  1
... Reformatted by _Wolfdieter Lang_, Feb 06 2020

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd. ed., 1994.

O. Aichholzer, A. Asinowski, and T. Miltzow, Disjoint compatibility graph of non-crossing matchings of points in convex position, arXiv preprint arXiv:1403.5546 [math.CO], 2014.
Jean-Christophe Aval, Multivariate Fuss-Catalan numbers, arXiv:0711.0906 [math.CO], 2007.
C. Banderier and D. Merlini, Lattice paths with an infinite set of jumps
W. G. Brown, Historical note on a recurrent combinatorial problem, Am. Math. Monthly 72 (1965) 973-977.
Sergio Caracciolo and Andrea Sportiello, Spanning forests on random planar lattices, J. Stat. Phys. 135, No. 5-6, 1063-1104 (2009).
CombOS - Combinatorial Object Server, Generate k-ary trees and dissections
M. Dziemianczuk, Enumerations of plane trees with multiple edges and Raney lattice paths, Discrete Mathematics 337 (2014): 9-24.
D. D. Frey and J. A. Sellers, Generalizing Bailey's generalization of the Catalan numbers, The Fibonacci Quarterly, 39 (2001) 142-148.
P. Hilton and J. Pedersen, Catalan Numbers, their generalization and their uses, The Mathematical Intelligencer 13 (1991) 64-75.
V. E. Hoggatt, Jr. and M. Bicknell, Catalan and related sequences arising from inverses of Pascal's triangle matrices, Fib. Quart., 14 (1976), 395-405.
V. U. Pierce, Combinatoric results for graphical enumeration and the higher Catalan numbers, arXiv:math/0703160 [math.CO], 2007.
J. H. Przytycki and A. S. Sikora, Polygon dissections and Euler, Fuss, Kirkman and Cayley numbers, arXiv:math/9811086 [math.CO], 1998.
H. S. Snevily and D. B. West, The Bricklayer Problem and the Strong Cycle Lemma, arXiv:math/9802026 [math.CO], 1998.
Donovan Young, Linear k-Chord Diagrams, arXiv:2004.06921 [math.CO], 2020. See also J. Int. Seq., Vol. 23 (2020), Article 20.9.1.

Reflected version of A070914.

Columns k=0..9 (without leading zeros) give sequences A000108 (Catalan), A001764, A002293, A002294, A002295, A002296, A007556, A062994, A059968, A230388.

a[n_, k_] = Binomial[(k+2)*(n-k), n-k]/((k+1)*(n-k) + 1);
Flatten[Table[a[n, k], {n, 0, 9}, {k, 0, n}]][[1 ;; 53]]
(* Jean-François Alcover, May 27 2011, after formula *)

a(n, k) = binomial((k+2)*(n-k), n-k)/((k+1)*(n-k)+1) = PF(n-k, k+2) if n-k >= 0, otherwise 0.

G.f. for column k: A(k, x) := x^k*RootOf(_Z^(k+2)*x-_Z+1) (Maple notation, from ECS, see links for column sequences and Graham et al. reference eq.(5.59) p. 200 and p. 349).

A213099 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^7)^3.

Original entry on oeis.org

1, 1, 3, 18, 112, 909, 7833, 74603, 740541, 7656219, 81187518, 878435208, 9647220024, 107137240686, 1199914011387, 13521738420240, 153051832116378, 1737562815056865, 19762347822563532, 224970273310192579, 2561375647064514444, 29149168085832027732

Offset: 0

Paul D. Hanna, Jun 05 2012

sign

Compare definition of g.f. to:
(1) B(x) = 1 + x/B(-x*B(x)) when B(x) = 1/(1-x).
(2) C(x) = 1 + x/C(-x*C(x)^3)^2 when C(x) = 1 + x*C(x)^2 (A000108).
(3) D(x) = 1 + x/D(-x*D(x)^5)^3 when D(x) = 1 + x*D(x)^3 (A001764).
(4) E(x) = 1 + x/E(-x*E(x)^7)^4 when E(x) = 1 + x*E(x)^4 (A002293).
(5) F(x) = 1 + x/F(-x*F(x)^9)^5 when F(x) = 1 + x*F(x)^5 (A002294).
The first negative term is a(121). - Georg Fischer, Feb 16 2019

			G.f.: A(x) = 1 + x + 3*x^2 + 18*x^3 + 112*x^4 + 909*x^5 + 7833*x^6 +...
Related expansions:
A(x)^7 = 1 + 7*x + 42*x^2 + 287*x^3 + 2079*x^4 + 16611*x^5 + 142702*x^6 +...
A(-x*A(x)^7)^3 = 1 - 3*x - 9*x^2 - 31*x^3 - 318*x^4 - 2586*x^5 - 25969*x^6 -...

Paul D. Hanna, Table of n, a(n) for n = 0..300

Cf. A000108, A001764, A002293, A002294, A213091, A213092, A213093, A213094, A213095, A213096, A213098, A213100, A213101, A213102, A213103, A213104, A213105.

m = 22; A[] = 1; Do[A[x] = 1 + x/A[-x A[x]^7]^3 + O[x]^m, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Nov 06 2019 *)

{a(n)=local(A=1+x+x*O(x^n));for(i=1,n,A=1+x/subst(A^3,x,-x*subst(A^7,x,x+x*O(x^n))) );polcoeff(A,n)}
for(n=0,30,print1(a(n),", "))

A213100 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^9)^3.

Original entry on oeis.org

1, 1, 3, 24, 181, 1893, 20601, 245176, 3018669, 38198478, 493218343, 6441378129, 84807054552, 1120545910725, 14820493111536, 195812569428897, 2580287366558579, 33878771120862777, 443012040333754728, 5770422757461475027, 74931929672784252306

Offset: 0

Paul D. Hanna, Jun 05 2012

sign

Compare definition of g.f. to:
(1) B(x) = 1 + x/B(-x*B(x)) when B(x) = 1/(1-x).
(2) C(x) = 1 + x/C(-x*C(x)^3)^2 when C(x) = 1 + x*C(x)^2 (A000108).
(3) D(x) = 1 + x/D(-x*D(x)^5)^3 when D(x) = 1 + x*D(x)^3 (A001764).
(4) E(x) = 1 + x/E(-x*E(x)^7)^4 when E(x) = 1 + x*E(x)^4 (A002293).
(5) F(x) = 1 + x/F(-x*F(x)^9)^5 when F(x) = 1 + x*F(x)^5 (A002294).
The first negative term is a(68). - Georg Fischer, Feb 16 2019

			G.f.: A(x) = 1 + x + 3*x^2 + 24*x^3 + 181*x^4 + 1893*x^5 + 20601*x^6 +...
Related expansions:
A(x)^9 = 1 + 9*x + 63*x^2 + 516*x^3 + 4563*x^4 + 45207*x^5 + 486579*x^6 +...
A(-x*A(x)^9)^3 = 1 - 3*x - 15*x^2 - 64*x^3 - 798*x^4 - 8277*x^5 - 99411*x^6 -...

Paul D. Hanna, Table of n, a(n) for n = 0..300

Cf. A000108, A001764, A002293, A002294, A213091, A213092, A213093, A213094, A213095, A213096, A213098, A213099, A213101, A213102, A213103, A213104, A213105.

m = 21; A[] = 1; Do[A[x] = 1 + x/A[-x A[x]^9]^3 + O[x]^m, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Nov 06 2019 *)

{a(n)=local(A=1+x+x*O(x^n));for(i=1,n,A=1+x/subst(A^3,x,-x*subst(A^9,x,x+x*O(x^n))) );polcoeff(A,n)}
for(n=0,30,print1(a(n),", "))

A213105 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^12)^6.

Original entry on oeis.org

1, 1, 6, 57, 614, 7716, 104322, 1529385, 23689968, 385885521, 6531397090, 114147452526, 2045979734964, 37435147640010, 696431496524796, 13134442980269397, 250527556214516892, 4824098879117797749, 93639919777995946446, 1830133457257882605430

Offset: 0

Paul D. Hanna, Jun 05 2012

nonn

Compare definition of g.f. to:
(1) B(x) = 1 + x/B(-x*B(x)) when B(x) = 1/(1-x).
(2) C(x) = 1 + x/C(-x*C(x)^3)^2 when C(x) = 1 + x*C(x)^2 (A000108).
(3) D(x) = 1 + x/D(-x*D(x)^5)^3 when D(x) = 1 + x*D(x)^3 (A001764).
(4) E(x) = 1 + x/E(-x*E(x)^7)^4 when E(x) = 1 + x*E(x)^4 (A002293).
(5) F(x) = 1 + x/F(-x*F(x)^9)^5 when F(x) = 1 + x*F(x)^5 (A002294).
(6) G(x) = 1 + x/G(-x*G(x)^11)^6 when G(x) = 1 + x*G(x)^6 (A002295).

			G.f.: A(x) = 1 + x + 6*x^2 + 57*x^3 + 614*x^4 + 7716*x^5 + 104322*x^6 +...
Related expansions:
A(x)^12 = 1 + 12*x + 138*x^2 + 1696*x^3 + 21723*x^4 + 292836*x^5 +...
A(-x*A(x)^12)^6 = 1 - 6*x - 21*x^2 - 146*x^3 - 1959*x^4 - 25056*x^5 -...

Cf. A213091, A213092, A213093, A213094, A213095, A213096.

Cf. A213098, A213099, A213100, A213101, A213102, A213103, A213104.

m = 20; A[] = 1; Do[A[x] = 1 + x/A[-x A[x]^12]^6 + O[x]^m, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Nov 06 2019 *)

{a(n)=local(A=1+x+x*O(x^n));for(i=1,n,A=1+x/subst(A^6,x,-x*subst(A^12,x,x+x*O(x^n))) );polcoeff(A,n)}
for(n=0,30,print1(a(n),", "))

A258708 Triangle read by rows: T(i,j) = integer part of binomial(i+j, i-j)/(2*j+1) for i >= 1 and j = 0..i-1.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 7, 4, 1, 1, 7, 14, 12, 5, 1, 1, 9, 25, 30, 18, 6, 1, 1, 12, 42, 66, 55, 26, 7, 1, 1, 15, 66, 132, 143, 91, 35, 8, 1, 1, 18, 99, 245, 334, 273, 140, 45, 9, 1, 1, 22, 143, 429, 715, 728, 476, 204, 57, 10, 1

Offset: 1

N. J. A. Sloane, Jun 12 2015

In the Loh-Shannon-Horadam paper, Table 3 contains a typo (see Extensions lines).
T(n,k) = round(A258993(n,k)/(2*k+1)). - Reinhard Zumkeller, Jun 22 2015
From Reinhard Zumkeller, Jun 23 2015: (Start)
(using tables 4 and 5 of the Loh-Shannon-Horadam paper, p. 8f).
T(n, n-1)  = 1;
T(n, n-2)  = n for n > 1;
T(n, n-3)  = A000969(n-3) for n > 2;
T(n, n-4)  = A000330(n-3) for n > 3;
T(n, n-5)  = T(2*n-7, 2) = A000970(n) for n > 4;
T(n, n-6)  = A000971(n) for n > 5;
T(n, n-7)  = A000972(n) for n > 6;
T(n, n-8)  = A000973(n) for n > 7;
T(n, 1)    = A001840(n-1) for n > 1;
T(2*n, n)  = A001764(n);
T(3*n-1, 1) = A000326(n);
T(3*n, 2*n) = A002294(n);
T(4*n, 3*n) = A002296(n). (End)

			Triangle T(i, j) (with rows i >= 1 and columns j >= 0) begins as follows:
  1;
  1,  1;
  1,  2,  1;
  1,  3,  3,   1;
  1,  5,  7,   4,   1;
  1,  7, 14,  12,   5,   1;
  1,  9, 25,  30,  18,   6,   1;
  1, 12, 42,  66,  55,  26,   7,  1;
  1, 15, 66, 132, 143,  91,  35,  8, 1;
  1, 18, 99, 245, 334, 273, 140, 45, 9, 1;
  ...

Reinhard Zumkeller, Rows n = 1..125 of triangle, flattened
R. P. Loh, A. G. Shannon, and A. F. Horadam, Divisibility Criteria and Sequence Generators Associated with Fermat Coefficients, Preprint, 1980.

Cf. A011793.
Cf. A007318, A258993, A158405, A005408, A006013 (central terms).
Cf. A000326, A000330, A000969, A000970, A000971, A000972, A000973, A000976, A001764, A001840, A002294, A002296.

a258708 n k = a258708_tabl !! (n-1) !! k
a258708_row n = a258708_tabl !! (n-1)
a258708_tabl = zipWith (zipWith ((round .) . ((/) `on` fromIntegral)))
                       a258993_tabl a158405_tabl
-- Reinhard Zumkeller, Jun 22 2015, Jun 16 2015

Corrected T(8,5) = 26 from Reinhard Zumkeller, Jun 13 2015

A346647 a(n) = Sum_{k=0..n} binomial(n,k) * binomial(5k,k) / (4k + 1).

Original entry on oeis.org

1, 2, 8, 54, 460, 4361, 43988, 462580, 5014252, 55624944, 628432101, 7205500484, 83632219892, 980710882430, 11601345881748, 138278231052451, 1659037424218780, 20020306637339944, 242835190201382648, 2958961154058610552, 36203518795424475661

Offset: 0

Ilya Gutkovskiy, Jul 26 2021

nonn

Binomial transform of A002294.

Seiichi Manyama, Table of n, a(n) for n = 0..500

Cf. A002294, A007317, A188687, A227035, A346646, A346648, A346649, A346650.

A346647 := proc(n)
    hypergeom([-n,1/5,2/5,3/5,4/5],[1/2,3/4,1,5/4],-3125/256) ;
    simplify(%) ;
end proc:
seq(A346647(n),n=0..40) ; # R. J. Mathar, Jan 10 2023

Table[Sum[Binomial[n, k] Binomial[5 k, k]/(4 k + 1), {k, 0, n}], {n, 0, 20}]
nmax = 20; A[] = 0; Do[A[x] = 1/(1 - x) + x (1 - x)^3 A[x]^5 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
nmax = 20; CoefficientList[Series[Sum[(Binomial[5 k, k]/(4 k + 1)) x^k/(1 - x)^(k + 1), {k, 0, nmax}], {x, 0, nmax}], x]
Table[HypergeometricPFQ[{1/5, 2/5, 3/5, 4/5, -n}, {1/2, 3/4, 1, 5/4}, -3125/256], {n, 0, 20}]

a(n) = sum(k=0, n, binomial(n,k)*binomial(5*k,k)/(4*k + 1)); \\ Michel Marcus, Jul 26 2021

G.f. A(x) satisfies: A(x) = 1 / (1 - x) + x * (1 - x)^3 * A(x)^5.
G.f.: Sum_{k>=0} ( binomial(5*k,k) / (4*k + 1) ) * x^k / (1 - x)^(k+1).
a(n) ~ 3381^(n + 3/2) / (78125 * sqrt(Pi) * n^(3/2) * 2^(8*n + 7/2)). - Vaclav Kotesovec, Jul 30 2021
D-finite with recurrence +8*n*(4*n+1) *(2*n-1)*(4*n-1)*a(n) +(-4405*n^4 +9322*n^3 -7655*n^2 +2978*n -480)*a(n-1) +12*(n-1) *(1255*n^3 -3829*n^2 +4204*n -1640) *a(n-2) -2*(n-1) *(n-2) *(10655*n^2 -32221*n +26076) *a(n-3) +4*(n-1) *(n-2) *(n-3)*(3445*n -6922) *a(n-4) -3381*(n-1)*(n-2) *(n-3)*(n-4)*a(n-5)=0. - R. J. Mathar, Aug 17 2023

A349311 G.f. A(x) satisfies: A(x) = (1 + x * A(x)^5) / (1 - x).

Original entry on oeis.org

1, 2, 12, 112, 1232, 14832, 189184, 2512064, 34358784, 480745984, 6848734464, 99003237376, 1448575666176, 21411827808256, 319255531155456, 4796005997940736, 72520546008219648, 1102912584949792768, 16859182461720526848, 258886644574700699648

Offset: 0

Ilya Gutkovskiy, Nov 14 2021

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..500

Cf. A002294, A006318, A346626, A346647, A349310, A349312, A349313, A349314.

nmax = 19; A[] = 0; Do[A[x] = (1 + x A[x]^5)/(1 - x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n + 4 k, 5 k] Binomial[5 k, k]/(4 k + 1), {k, 0, n}], {n, 0, 19}]

a(n) = Sum_{k=0..n} binomial(n+4*k,5*k) * binomial(5*k,k) / (4*k+1).
a(n) = F([(1+n)/4, (2+n)/4, (3+n)/4, (4+n)/4, -n], [1/2, 3/4, 1, 5/4], -1), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 14 2021
a(n) ~ sqrt(1 + 4*r) / (2 * 5^(3/4) * sqrt(2*Pi) * (1-r)^(1/4) * n^(3/2) * r^(n + 1/4)), where r = 0.0600920016324256496641829206872407657377702010870270617... is the real root of the equation 4^4 * (1-r)^5 = 5^5 * r. - Vaclav Kotesovec, Nov 15 2021

A079678 a(n) = a(n,m) = Sum_{k=0..n} binomial(mk,k)binomial(m*(n-k),n-k) for m=5.

Original entry on oeis.org

1, 10, 115, 1360, 16265, 195660, 2361925, 28577440, 346316645, 4201744870, 51023399190, 620022989200, 7538489480075, 91696845873760, 1115794688036920, 13581508654978560, 165357977228808925, 2013721466517360650, 24527742112263770425, 298805688708113438240, 3640695209795092874290

Offset: 0

Benoit Cloitre, Jan 26 2003

nonn

More generally : a(n,m)=sum(k=0,n,binomial(m*k,k)*binomial(m*(n-k),n-k)) is asymptotic to 1/2*m/(m-1)*(m^m/(m-1)^(m-1))^n. See A000302, A006256, A078995 for cases m=2,3 and 4.

Robert Israel, Table of n, a(n) for n = 0..828
D. Merlini, R. Sprugnoli and M. C. Verri, The tennis ball problem, J. Combin. Theory, A 99 (2002), 307-344.
Rui Duarte and António Guedes de Oliveira, Short note on the convolution of binomial coefficients, arXiv:1302.2100 [math.CO], 2013.

Cf. A006256, A078995, A079563, A079679.

Cf. A371753, A385632, A386812.

seq(add(binomial(5*k,k)*binomial(5*(n-k),n-k),k=0..n), n=0..30); # Robert Israel, Jul 16 2015

m = 5; Table[Sum[Binomial[m k, k] Binomial[m (n - k), n - k], {k, 0, n}], {n, 0, 17}] (* Michael De Vlieger, Sep 30 2015 *)

main(size)=my(k,n,m=5); concat(1,vector(size,n, sum(k=0,n, binomial(m*k,k)*binomial(m*(n-k),n-k)))) \\ Anders Hellström, Jul 16 2015

a(n) = sum(k=0,n,4^(n-k)*binomial(5*n+1,k));
vector(30, n, a(n-1)) \\ Altug Alkan, Sep 30 2015

a(n) = 5/8*(3125/256)^n*(1+c/sqrt(n)+o(n^-1/2)) where c=0.356...
c = sqrt(2)/sqrt(5*Pi) = 0.3568248232305542229... - Vaclav Kotesovec, May 25 2020
a(n) = Sum_{k=0..n} binomial(5*k+l,k) * binomial(5*(n-k)-l,n-k) for every real number l. - Rui Duarte and António Guedes de Oliveira, Feb 16 2013
From Rui Duarte and António Guedes de Oliveira, Feb 17 2013: (Start)
a(n) = Sum_{k=0..n} 4^(n-k) * binomial(5*n+1,k).
a(n) = Sum_{k=0..n} 5^(n-k) * binomial(4*n+k,k). (End)
G.f.: hypergeom([1/5, 2/5, 3/5, 4/5], [1/4, 1/2, 3/4], (3125/256)*x)^2 satisfies
((3125/2)*g^3*x^4-128*g^3*x^3)*g''''+((-3125*g^2*x^4+256*g^2*x^3)*g'+12500*g^3*x^3-576*g^3*x^2)*g'''+(-(9375/4)*g^2*x^4+192*g^2*x^3)*g''^2+(((28125/4)*g*x^4-576*g*x^3)*(g')^2+(-18750*g^2*x^3+864*g^2*x^2)*g'+22500*g^3*x^2-408*g^3*x)*g''+(-(46875/16)*x^4+240*x^3)*(g')^4+(9375*g*x^3-432*g*x^2)*(g')^3+(-11250*g^2*x^2+204*g^2*x)*(g')^2+(7500*g^3*x-12*g^3)*g'+120*g^4 = 0. - Robert Israel, Jul 16 2015
a(n) = [x^n] 1/((1-5*x) * (1-x)^(4*n+1)). - Seiichi Manyama, Aug 03 2025
From Seiichi Manyama, Aug 14 2025: (Start)
a(n) = Sum_{k=0..n} 5^k * (-4)^(n-k) * binomial(5*n+1,k) * binomial(5*n-k,n-k).
G.f.: g^2/(5-4*g)^2 where g = 1+x*g^5 is the g.f. of A002294. (End)

cp's OEIS Frontend

A213104 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^10)^5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A349332 G.f. A(x) satisfies A(x) = 1 + x * A(x)^5 / (1 - x).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A062993 A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A213099 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^7)^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A213100 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^9)^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A213105 G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^12)^6.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

A258708 Triangle read by rows: T(i,j) = integer part of binomial(i+j, i-j)/(2*j+1) for i >= 1 and j = 0..i-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Extensions

A346647 a(n) = Sum_{k=0..n} binomial(n,k) * binomial(5*k,k) / (4*k + 1).

Views

A346647 a(n) = Sum_{k=0..n} binomial(n,k) * binomial(5k,k) / (4k + 1).

A079678 a(n) = a(n,m) = Sum_{k=0..n} binomial(mk,k)binomial(m*(n-k),n-k) for m=5.