A002694 -id:A002694 - cp's OEIS frontend

A002696 Binomial coefficients C(2n,n-3).

1, 8, 45, 220, 1001, 4368, 18564, 77520, 319770, 1307504, 5311735, 21474180, 86493225, 347373600, 1391975640, 5567902560, 22239974430, 88732378800, 353697121050, 1408831480056, 5608233007146, 22314239266528, 88749815264600, 352870329957600, 1402659561581460

Offset: 3

N. J. A. Sloane

Number of lattice paths from (0,0) to (n,n) with steps E=(1,0) and N=(0,1) which touch or cross the line x-y=3. - Herbert Kociemba, May 23 2004

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
C. Lanczos, Applied Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1956, p. 517.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Robert Israel, Table of n, a(n) for n = 3..1497
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
A. Claesson and T. Mansour, Counting patterns of type (1,2) or (2,1), arXiv:math/0110036 [math.CO], 2001.
Milan Janjic, Two Enumerative Functions
C. Lanczos, Applied Analysis (Annotated scans of selected pages)
Toufik Mansour and Mark Shattuck, Counting occurrences of subword patterns in non-crossing partitions, Art Disc. Appl. Math. (2022).
R. Parviainen, Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13, Journal of Integer Sequences, Vol. 9 (2006), Article 06.3.2.
Franck Ramaharo, Statistics on some classes of knot shadows, arXiv:1802.07701 [math.CO], 2018.
Hermann Stamm-Wilbrandt, Compute C(2n, n-k) based on C(n,...) animation
Daniel W. Stasiuk, An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads, Master's Thesis, University of Saskatchewan-Saskatoon (2018).

Diagonal 7 of triangle A100257.
Column k=1 of A263776.
Cf. A001622.
Cf. binomial(2*n+m, n): A000984 (m = 0), A001700 (m = 1), A001791 (m = 2), A002054 (m = 3), A002694 (m = 4), A003516 (m = 5), A030053 - A030056, A004310 - A004318.

List([3..30], n-> Binomial(2*n, n-3)) # G. C. Greubel, Mar 21 2019

[ Binomial(2*n,n-3): n in [3..30] ]; // Vincenzo Librandi, Apr 13 2011

A002696:=n->binomial(2*n,n-3): seq(A002696(n), n=3..30); # Wesley Ivan Hurt, Aug 19 2015

CoefficientList[Series[64/(((Sqrt[1-4x] +1)^6)*Sqrt[1-4x]), {x,0,30}], x] (* Robert G. Wilson v, Aug 08 2011 *)

a(n)=binomial(n+n,n-3) \\ Charles R Greathouse IV, Aug 08 2011

[binomial(2*n, n-3) for n in (3..30)] # G. C. Greubel, Mar 21 2019

G.f.: (1-sqrt(1-4*z))^6/(64*z^3*sqrt(1-4*z)). - Emeric Deutsch, Jan 28 2004
a(n) = Sum_{k=0..n} C(n, k)*C(n, k+3). - Hermann Stamm-Wilbrandt, Aug 17 2015
From Robert Israel, Aug 19 2015: (Start)
(n-2)*(n+4)*a(n+1) = (2*n+2)*(2*n+1)*a(n).
E.g.f.: I_3(2*x) * exp(2*x) where I_3 is a modified Bessel function. (End)
From Amiram Eldar, Aug 27 2022: (Start)
Sum_{n>=3} 1/a(n) = 3/4 + 2*Pi/(9*sqrt(3)).
Sum_{n>=3} (-1)^(n+1)/a(n) = 444*log(phi)/(5*sqrt(5)) - 1093/60, where phi is the golden ratio (A001622). (End)
G.f.: 2F1([7/2,4],[7],4*x). - Karol A. Penson, Apr 24 2024
From Peter Bala, Oct 13 2024: (Start)
a(n) = Integral_{x = 0..4} x^n * w(x) dx, where the weight function w(x) = 1/(2*Pi) * (x^3 - 6*x^2 + 9*x - 2)/sqrt(x*(4 - x)).
G.f: x^3 * B(x) * C(x)^6, where B(x) = 1/sqrt(1 - 4*x) is the g.f. of the central binomial coefficients A000984 and C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108. (End)

More terms from Emeric Deutsch, Feb 18 2004

A062991 Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x).

Original entry on oeis.org

1, 2, -1, 5, -6, 2, 14, -28, 20, -5, 42, -120, 135, -70, 14, 132, -495, 770, -616, 252, -42, 429, -2002, 4004, -4368, 2730, -924, 132, 1430, -8008, 19656, -27300, 23100, -11880, 3432, -429, 4862, -31824, 92820, -157080, 168300, -116688, 51051, -12870, 1430

Offset: 0

Wolfdieter Lang, Jul 12 2001

The g.f. for the sequence of column m of triangle A009766(n,m) (or Catalan A033184(n,n-m) diagonals) is N(2; m-1,x)*(x^m)/(1-x)^(m+1), m >= 1, with N(2; n,x) = Sum_{k=0..n} T(n,k)*x^k.
For k=0..1 the column sequences give A000108(n+1) (Catalan), -A002694. The row sums give A000012 (powers of 1) and (unsigned) A062992.
Another version of [1, 1, 1, 1, 1, 1, 1, 1, ...] DELTA [0, -1, -1, -1, -1, -1, -1, -1, ...] = 1; 1, 0; 2, -1, 0; 5, -6, 2, 0; 14, -28, 20, -5, 0; 42, -120, 135, -70, 14, 0; ... where DELTA is Deléham's operator defined in A084938.
The positive triangle is |T(n,k)| = binomial(2*n+2, n-k)*binomial(n+k, k)/(n+1). - Paul Barry, May 11 2005

			The triangle N2 = {a(n,k)} begins:
n\k      0       1      2       3       4       5      6       7     8     9
----------------------------------------------------------------------------
0:       1
1:       2      -1
2:       5      -6      2
3:      14     -28     20      -5
4:      42    -120    135     -70      14
5:     132    -495    770    -616     252     -42
6:     429   -2002   4004   -4368    2730    -924    132
7:    1430   -8008  19656  -27300   23100  -11880   3432    -429
8:    4862  -31824  92820 -157080  168300 -116688  51051  -12870  1430
9:   16796 -125970 426360 -852720 1108536 -969969 570570 -217360 48620 -4862
... formatted by _Wolfdieter Lang_, Jan 20 2020
N(2; 2, x)= 5 - 6*x + 2*x^2.

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
C. A. Francisco, J. Mermin, and J. Schweig, Catalan numbers, binary trees, and pointed pseudotriangulations, 2013.
V. E. Hoggatt Jr. and Marjorie Bicknell-Johnson, Numerator Polynomial Coefficient Arrays for Catalan and Related Sequence Convolution Triangles, The Fibonacci Quarterly 15 (1977) 30-34. [On p. 31, in the line n = 1, 14 is missing in S_1^4. - _Wolfdieter Lang_, Jan 20 2020 ]
Joseph T. Iosue, Adam Ehrenberg, Dominik Hangleiter, Abhinav Deshpande, and Alexey V. Gorshkov, Page curves and typical entanglement in linear optics, arXiv:2209.06838 [quant-ph], 2022.
A. Lakshminarayan, Z. Puchala, and K. Zyczkowski, Diagonal unitary entangling gates and contradiagonal quantum states, arXiv preprint arXiv:1407.1169 [quant-ph], 2014.
Jian Zhou, On Some Mathematics Related to the Interpolating Statistics, arXiv:2108.10514 [math-ph], 2021.

Cf. A000108, A002694, A009766, A033184, A062992, A084938, A089434, A094385.
For an unsigned version see Borel's triangle, A234950.
Sums include: A000012 (row), A000079 (diagonal), A064062 (signed row), A071356 (signed diagonal).

A062991:= func< n,k | (-1)^k*Binomial(2*n+2,n-k)*Binomial(n+k,k)/(n+1) >;
[A062991(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Sep 27 2024

T[n_, k_] := 2 (-1)^k Binomial[2n+1, n] (n-k+1) Binomial[n+1, k]/((k+n+1)(k+n+2));
Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Jean-François Alcover, Sep 19 2018 *)

def A062991(n,k): return (-1)^k*binomial(2*n+2,n-k)*binomial(n+k,k)/(n+1)
flatten([[A062991(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Sep 27 2024

T(n, k) = [x^k] N(2; n, x) with N(2; n, x) = (N(2; n-1, x) - A000108(n)*(1-x)^(n+1))/x, N(2; 0, x) = 1.
T(n, k) = T(n-1, k+1) + (-1)^k*binomial(n+1, k+1)*binomial(2*n+1, n)/(2*n+1) if k=0, .., (n-2); T(n, k) = (-1)^k*binomial(n+1, k+1)*binomial(2*n+1, n)/(2*n+1) if k=(n-1) or n; else 0.
O.g.f. (with offset 1) is the series reversion w.r.t. x of x*(1+x*t)/(1+x)^2. If R(n,t) denotes the n-th row polynomial of this triangle then R(n,1-t) is the n-th row polynomial of A009766. Cf. A089434. - Peter Bala, Jul 15 2012
From G. C. Greubel, Sep 27 2024: (Start)
Sum_{k=0..n} T(n, k) = A000012(n).
Sum_{k=0..n} (-1)^k*T(n, k) = A064062(n+1).
Sum_{k=0..floor(n/2)} T(n-k, k) = A000079(n).
Sum_{k=0..floor(n/2)} (-1)^k*T(n-k, k) = A071356(n). (End)

A030053 a(n) = binomial(2n+1,n-3).

Original entry on oeis.org

1, 9, 55, 286, 1365, 6188, 27132, 116280, 490314, 2042975, 8436285, 34597290, 141120525, 573166440, 2319959400, 9364199760, 37711260990, 151584480450, 608359048206, 2438362177020, 9762479679106, 39049918716424, 156077261327400, 623404249591760

Offset: 3

N. J. A. Sloane

Number of UUUUUU's in all Dyck (n+3)-paths. - David Scambler, May 03 2013

			G.f. = x^3 + 9*x^4 + 55*x^5 + 286*x^6 + 1365*x^7 + 6188*x68 + ...

T. D. Noe, Table of n, a(n) for n = 3..200
Milan Janjic, Two Enumerative Functions.
Asamoah Nkwanta and Earl R. Barnes, Two Catalan-type Riordan Arrays and their Connections to the Chebyshev Polynomials of the First Kind, Journal of Integer Sequences, Vol. 15 (2012), Article 12.3.3. - From _N. J. A. Sloane_, Sep 16 2012.

Diagonal 8 of triangle A100257.
Cf. A001622, A113187 (unsigned fourth column).
Cf. binomial(2*n+m, n): A000984 (m = 0), A001700 (m = 1), A001791 (m = 2), A002054 (m = 3), A002694 (m = 4), A003516 (m = 5), A002696 (m = 6), A030054 - A030056, A004310 - A004318.

[Binomial(2*n+1,n-3): n in [3..30]]; // Vincenzo Librandi, Aug 11 2015

Table[Binomial[2*n + 1, n - 3], {n, 3, 20}] (* T. D. Noe, Apr 03 2014 *)
Rest[Rest[Rest[CoefficientList[Series[128 x^3 / ((1 - Sqrt[1 - 4 x])^7 Sqrt[1 - 4 x]) + (-1 / x^4 + 5 / x^3 - 6 / x^2 + 1 / x), {x, 0, 40}], x]]]] (* Vincenzo Librandi, Aug 11 2015 *)

a(n) = binomial(2*n+1,n-3); \\ Joerg Arndt, May 08 2013

G.f.: x^3*128/((1-sqrt(1-4*x))^7*sqrt(1-4*x))+(-1/x^4+5/x^3-6/x^2+1/x). - Vladimir Kruchinin, Aug 11 2015
D-finite with recurrence: -(n+4)*(n-3)*a(n) +2*n*(2*n+1)*a(n-1)=0. - R. J. Mathar, Jan 28 2020
G.f.: x^3* 2F1(4,9/2;8;4x). - R. J. Mathar, Jan 28 2020
From Amiram Eldar, Jan 24 2022: (Start)
Sum_{n>=3} 1/a(n) = 22*Pi/(9*sqrt(3)) - 33/10.
Sum_{n>=3} (-1)^(n+1)/a(n) = 852*log(phi)/(5*sqrt(5)) - 1073/30, where phi is the golden ratio (A001622). (End)
From Peter Bala, Oct 13 2024: (Start)
a(n) = Integral_{x = 0..4} x^n * w(x) dx, where the weight function w(x) = (1/(2*Pi)) * sqrt(x)*(x^3 - 7*x^2 + 14*x - 7)/sqrt((4 - x)).
G.f. x^3 * B(x) * C(x)^7, where B(x) = 1/sqrt(1 - 4*x) is the g.f. of the central binomial coefficients A000984 and C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108. (End)

A067311 Triangle read by rows: T(n,k) gives number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords) - positive values only.

Original entry on oeis.org

1, 1, 2, 1, 5, 6, 3, 1, 14, 28, 28, 20, 10, 4, 1, 42, 120, 180, 195, 165, 117, 70, 35, 15, 5, 1, 132, 495, 990, 1430, 1650, 1617, 1386, 1056, 726, 451, 252, 126, 56, 21, 6, 1, 429, 2002, 5005, 9009, 13013, 16016, 17381, 16991, 15197, 12558, 9646, 6916, 4641, 2912, 1703, 924, 462, 210, 84, 28, 7, 1

Offset: 0

Henry Bottomley, Jan 14 2002

Row n contains 1 + n(n-1)/2 entries. - Emeric Deutsch, Jun 03 2009
Row sums are A001147 (double factorials).
Columns include A000108 (Catalan) for k=0 and A002694 for k=1.
Coefficients of Touchard-Riordan polynomials defined on page 3 of the Chakravarty and Kodama paper, related to the array A039599 through the polynomial numerators of Eqn. 2.1. - Tom Copeland, May 26 2016

			Rows start:
   1;
   1;
   2,   1;
   5,   6,   3,   1;
  14,  28,  28,  20,  10,   4,   1;
  42, 120, 180, 195, 165, 117,  70,  35,  15,   5,   1;
etc.,
i.e., there are 5 ways of arranging 3 chords with no intersections, 6 with one, 3 with two and 1 with three.

P. Flajolet and M. Noy, Analytic combinatorics of chord diagrams; in Formal Power Series and Algebraic Combinatorics, pp. 191-201, Springer, 2000.

Andrew Howroyd, Table of n, a(n) for n = 0..4525 (rows 0..30)
Alt.Math, alt.math.recreational discussion
H. Bottomley, Illustration for A000108, A001147, A002694, A067310 and A067311
S. Chakravarty and Y. Kodama, A generating function for the N-soliton solutions of the Kadomtsev-Petviashvili II equation, arXiv preprint arXiv:0802.0524v2 [nlin.SI], 2008.
FindStat - Combinatorial Statistic Finder, The number of nestings of a perfect matching., The number of crossings of a perfect matching.
P. Flajolet and M. Noy, Analytic combinatorics of chord diagrams, [Research Report] RR-3914, INRIA. 2000.
P. Luschny, First 10 rows of triangle (taken from Luschny link below)
P. Luschny, Variants of Variations.
J.-G. Penaud, Une preuve bijective d'une formule de Touchard-Riordan, Discrete Math., 139, 1995, 347-360. [From _Emeric Deutsch_, Jun 03 2009]
H. Prodinger, On Touchard's continued fraction and extensions: combinatorics-free, self-contained proofs , arXiv:1102.5186 [math.CO], 2011.
J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp., 29 (1975), 215-222.
J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp., 29 (1975), 215-222. [Annotated scanned copy]
Lucas Sá and Antonio M. García-García, The Wishart-Sachdev-Ye-Kitaev model: Q-Laguerre spectral density and quantum chaos, arXiv:2104.07647 [hep-th], 2021.

A067310 has a different view of the same table.

Cf. A039599.

p := proc (n) options operator, arrow: sort(simplify((sum((-1)^j*q^((1/2)*j*(j-1))*binomial(2*n, n+j), j = -n .. n))/(1-q)^n)) end proc; for n from 0 to 7 do seq(coeff(p(n), q, i), i = 0 .. (1/2)*n*(n-1)) end do; # yields sequence in triangular form; Emeric Deutsch, Jun 03 2009

nmax = 15; se[n_] := se[n] = Series[ Sum[(-1)^j*q^(j(j-1)/2)*Binomial[2 n, n+j], {j, -n, n}]/(1-q)^n , {q, 0, nmax}];
t[n_, k_] := Coefficient[se[n], q^k]; t[n_, 0] = Binomial[2 n, n]/(n + 1);
Select[Flatten[Table[t[n, k], {n, 0, nmax}, {k, 0, 2nmax}] ], Positive] [[1 ;; 55]]
(* Jean-François Alcover, Jun 22 2011, after Emeric Deutsch *)

M(n)=1/(1-q)^n*sum(k=0, n, (-1)^k * ( binomial(2*n,n-k)-binomial(2*n,n-k-1)) * q^(k*(k+1)/2) );
for (n=0,10, print( Vec(polrecip(M(n))) ) ); /* print rows */
/* Joerg Arndt, Oct 01 2012 */

T(n,k) = Sum_{j=0..n-1} (-1)^j * C((n-j)*(n-j+1)/2-1-k, n-1) * (C(2n, j) - C(2n, j-1)).
Generating polynomial of row n is (1-q)^(-n)*Sum_{j=-n..n} (-1)^j*q^(j*(j-1)/2)*binomial(2*n,n+j). - Emeric Deutsch, Jun 03 2009
O.g.f. as a continued fraction: 1/(1 - t/(1 - (1 + x)*t/(1 - (1 + x + x^2)*t/(1 - (1 + x + x^2 + x^3)*t/(1 - ...))))) = 1 + t + (2 + x)*t^2 + (5 + 6*x +3*x^2 + x^4)*t^3 + .... See Chakravarty and Kodama, equation 3.8. - Peter Bala, Jun 13 2019

a(55) onwards from Andrew Howroyd, Nov 22 2024

A004321 Binomial coefficient C(3n, n-3).

Original entry on oeis.org

1, 12, 105, 816, 5985, 42504, 296010, 2035800, 13884156, 94143280, 635745396, 4280561376, 28760021745, 192928249296, 1292706174900, 8654327655120, 57902201338905, 387221678682300, 2588713818544245

Offset: 3

N. J. A. Sloane

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.

Michael De Vlieger, Table of n, a(n) for n = 3..1209
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Alin Bostan, Frédéric Chyzak, and Vincent Pilaud, Refined product formulas for Tamari intervals, arXiv:2303.10986 [math.CO], 2023.
Milan Janjic, Two Enumerative Functions
Daniel W. Stasiuk, An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads, Master's Thesis, University of Saskatchewan-Saskatoon (2018).

Cf. binomial(k*n, n-k): A000027 (k=1), A002694 (k=2), this sequence (k=3), A004334 (k=4), A004347 (k=5), A004361 (k=6), A004375 (k=7), A004389 (k=8), A281580 (k=9).

List([3..30], n-> Binomial(3*n,n-3)); # G. C. Greubel, Mar 21 2019

[Binomial(3*n,n-3): n in [3..30]]; // G. C. Greubel, Mar 21 2019

a:=n->sum(binomial(2*n-2,n+j)*binomial(n-1,n-j+1),j=0..n): seq(a(n), n=4..22); # Zerinvary Lajos, Jan 29 2007

Table[Binomial[3n, n-3], {n,3,30}] (* Wesley Ivan Hurt, Feb 04 2014 *)

{a(n) = binomial(3*n, n-3)}; \\ G. C. Greubel, Mar 21 2019

[binomial(3*n,n-3) for n in (3..30)] # G. C. Greubel, Mar 21 2019

From Ilya Gutkovskiy, Jan 31 2017: (Start)
E.g.f.: (1/6)*x^3*2F2(10/3,11/3; 5,11/2; 27*x/4).
a(n) ~ 3^(3*n+1/2)/(sqrt(Pi*n)*4^(n+2)). (End)
D-finite with recurrence -2*(2*n+3)*(n-3)*(n+1)*a(n) +3*n*(3*n-1)*(3*n-2)*a(n-1)=0. - R. J. Mathar, Jan 13 2025

A062344 Triangle of binomial(2*n, k) with n >= k.

Original entry on oeis.org

1, 1, 2, 1, 4, 6, 1, 6, 15, 20, 1, 8, 28, 56, 70, 1, 10, 45, 120, 210, 252, 1, 12, 66, 220, 495, 792, 924, 1, 14, 91, 364, 1001, 2002, 3003, 3432, 1, 16, 120, 560, 1820, 4368, 8008, 11440, 12870, 1, 18, 153, 816, 3060, 8568, 18564, 31824, 43758, 48620

Offset: 0

Henry Bottomley, Jul 06 2001

From Wolfdieter Lang, Sep 19 2012: (Start)
The triangle a(n,k) appears in the formula F(2*l+1)^(2*n) = (sum(a(n,k)*L(2*(n-k)*(2*l+1)),k=0..n-1) + a(n,n))/5^n, n>=0, l>=0, with F=A000045 (Fibonacci) and L=A000032 (Lucas).
The signed triangle as(n,k):=a(n,k)*(-1)^k appears in the formula F(2*l)^(2*n) = (sum(as(n,k)*L(4*(n-k)*l),k=0..n-1) + as(n,n))/5^n, n>=0, l>=0. Proof with the Binet-de Moivre formula for F and L and the binomial formula. (End)

			Rows start
  (1),
  (1,2),
  (1,4,6),
  (1,6,15,20)
  etc.
Row n=2, (1,4,6):
F(2*l+1)^4 = (1*L(4*(2*l+1)) + 4*L(2*(2*l+1)) + 6)/25,
F(2*l)^4 = (1*L(8*l) - 4*L(4*l) + 6)/25, l>=0, F=A000045, L=A000032. See a comment above. - _Wolfdieter Lang_, Sep 19 2012

G. C. Greubel, Rows n = 0..100 of triangle, flattened
E. H. M. Brietzke, An identity of Andrews and a new method for the Riordan array proof of combinatorial identities, Discrete Math., 308 (2008), 4246-4262.
C. Lanczos, Applied Analysis (Annotated scans of selected pages)
Index entries for triangles and arrays related to Pascal's triangle

Columns include (sometimes truncated) A000012, A005843, A000384, A002492, A053134 etc. Right hand side includes A000984, A001791, A002694, A002696 etc. Row sums are A032443. Row alternate differences (e.g., 6-4+1=3 or 20-15+6-1=10) are A001700.
Cf. A122366.
a(2*n,n) gives A005810.

[[Binomial(2*n, k): k in [0..n]]: n in [0..20]]; // G. C. Greubel, Jun 28 2018

Flatten[Table[Binomial[2 n, k], {n, 0, 20}, {k, 0, n}]] (* G. C. Greubel, Jun 28 2018 *)

create_list(binomial(2*n,k),n,0,9,k,0,n); /* Emanuele Munarini, Mar 11 2011 */

for(n=0, 20, for(k=0, n, print1(binomial(2*n, k), ", "))) \\ G. C. Greubel, Jun 28 2018

a(n,k) = a(n,k-1)*((2*n+1)/k-1) with a(n,0)=1.

G.f.: 1/((1-sqrt(1-4*x*y))^4/(16*x*y^2) + sqrt(1-4*x*y) - x). - Vladimir Kruchinin, Jan 26 2021

A094385 Triangle read by rows: T(n, k) = binomial(2n, k-1)binomial(2*n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0^n.

Original entry on oeis.org

1, 0, 1, 0, 1, 2, 0, 2, 6, 5, 0, 5, 20, 28, 14, 0, 14, 70, 135, 120, 42, 0, 42, 252, 616, 770, 495, 132, 0, 132, 924, 2730, 4368, 4004, 2002, 429, 0, 429, 3432, 11880, 23100, 27300, 19656, 8008, 1430, 0, 1430, 12870, 51051, 116688, 168300, 157080, 92820, 31824, 4862

Offset: 0

Philippe Deléham, Jun 03 2004, Jun 14 2007

			Triangle begins:
  1;
  0,   1;
  0,   1,    2;
  0,   2,    6,     5;
  0,   5,   20,    28,    14;
  0,  14,   70,   135,   120,    42;
  0,  42,  252,   616,   770,   495,   132;
  0, 132,  924,  2730,  4368,  4004,  2002,  429;
  0, 429, 3432, 11880, 23100, 27300, 19656, 8008, 1430; ...

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
Paul Barry, A Note on a Family of Generalized Pascal Matrices Defined by Riordan Arrays, Journal of Integer Sequences, 16 (2013), #13.5.4.
Yue Cai and Catherine Yan, Counting with Borel's triangle, Texas A&M University.
Yue Cai and Catherine Yan, Counting with Borel's triangle, arXiv:1804.01597 [math.CO], 2018.
B. Derrida, E. Domany and D. Mukamel, A exact solution of a one-dimensional asymmetric exclusion model with open boundaries, J. Stat. Phys. 69, 1992, 667-687; eqs.(20), (21), p. 672.
Jian Zhou, On Some Mathematics Related to the Interpolating Statistics, arXiv:2108.10514 [math-ph], 2021.

Variant of A062991, unsigned and transposed.
See also A234950 for another version.
Columns: A000007 (k=0), 2*A001700 (k=1).
Diagonals: A002694 (k=n-1), A000108 (k=n).
Row sums: A064062 (generalized Catalan C(2; n)).
Cf. A000012, A002694, A064062, A064063, A064087, A064088, A064089.
Cf. A064090, A064091, A064092, A064093, A064094.

A094385:= func< n,k | n eq 0 select 1 else Binomial(2*n, k-1)*Binomial(2*n-k-1, n-k)/n >;
[A094385(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Sep 26 2024

T[n_, k_] := Binomial[2n, k-1] Binomial[2n-k-1, n-k]/n; T[0, 0] = 1;
Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Sep 19 2018 *)

def A094385(n,k): return 1 if (n==0) else binomial(2*n,k-1)*binomial(2*n-k-1, n-k)//n
flatten([[A094385(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Sep 26 2024

T is given by [0, 1, 1, 1, 1, 1, 1, ...] DELTA [1, 1, 1, 1, 1, 1, 1, 1, 1, ...] where DELTA is the operator defined in A084938.
Sum_{k = 0..n} T(n, k)*x^(n-k) = C(x+1; n), generalized Catalan numbers; see left diagonals of triangle A064094: A000012, A000108, A064062, A064063, A064087..A064093 for x = -1, 0, ..., 9, respectively.
From G. C. Greubel, Sep 26 2024: (Start)
T(n, 1) = A000108(n-1), n >= 1.
T(n, n-1) = A002694(n), n >= 1.
T(n, n) = A000108(n). (End)

New name using a formula of the author by Peter Luschny, Sep 26 2024

A344191 a(n) = Catalan(n) * (n^2 + 2) / (n + 2).

Original entry on oeis.org

1, 1, 3, 11, 42, 162, 627, 2431, 9438, 36686, 142766, 556206, 2169268, 8469060, 33096195, 129454695, 506793270, 1985612310, 7785510810, 30548406570, 119944382220, 471241577820, 1852521913710, 7286586193926, 28675561428972, 112905199767052, 444752335104252

Offset: 0

F. Chapoton, May 11 2021

nonn

Conjecture: These are the number of linear intervals in Pallo's comb posets. An interval is linear if it is isomorphic to a total order. The conjecture has been checked up to the term 36686 for n = 9.

			All 3 intervals in the poset of cardinality 2 are linear. All 11 intervals in the poset of cardinality 5 are linear.

Michael De Vlieger, Table of n, a(n) for n = 0..1664
Jean-Luc Baril, Sergey Kirgizov, and Armen Petrossian, Dyck Paths with catastrophes modulo the positions of a given pattern, Australasian J. Comb. (2022) Vol. 84, No. 2, 398-418.
Clément Chenevière, Enumerative study of intervals in lattices of Tamari type, Ph. D. thesis, Univ. Strasbourg (France), Ruhr-Univ. Bochum (Germany), HAL tel-04255439 [math.CO], 2024. See p. 150.
J. M. Pallo, Right-arm rotation distance between binary trees, Inform. Process. Lett., 87(4):173-177, 2003.

Cf. A000108, A002694, A127632, A344136, A121686.

a := n -> `if`(n = 0, 1, a(n-1)*(2*(2*n-1)*(n^2+2))/((n+2)*(n^2-2*n+3))):
seq(a(n), n = 0..19); # Peter Luschny, May 11 2021

a[n_] := CatalanNumber[n] (n^2 + 2) / (n + 2);
Table[a[n], { n, 0, 23}] (* Peter Luschny, May 11 2021 *)

a(n) = (binomial(2*n,n)/(n+1))*((n^2 + 2)/(n + 2)); \\ Michel Marcus, May 11 2021

def a(n):
    return catalan_number(n)+sum(2**(n-k)/factorial(k-2)*(n-k+4)/(n+2)*prod(n+i for i in range(2, k)) for k in range(2, n+1))

def a(n): return catalan_number(n) + binomial(2*n, n-2)
print([a(n) for n in range(24)]) # Peter Luschny, May 11 2021

a(n) = Catalan(n) + (1/(n + 2))*Sum_{k=2..n}((2^(n - k)*(n - k + 4)/(k - 2)!)* Product_{i=2..k-1}(n + i)).
From Peter Luschny, May 11 2021: (Start)
a(n) = [x^n] ((2*x + sqrt(1 - 4*x) - 1)*(3*x - 1))/(2*sqrt(1 - 4*x)*x^2).
a(n) = n! * [x^n] exp(2*x)*(BesselI(0, 2*x) - BesselI(1, 2*x) + BesselI(2, 2*x)).
a(n) = a(n-1)*(2*(2*n - 1)*(n^2 + 2))/((n + 2)*(n^2 - 2*n + 3)) for n >= 1.
a(n) = Catalan(n) + binomial(2*n, n-2) = A000108(n) + A002694(n).
a(n) ~ (2^(2*n - 3)*(8*n - 25)) / (sqrt(Pi)*n^(3/2)). (End)
a(n) = A121686(n) / 2. - Hugo Pfoertner, May 11 2021

A030054 a(n) = binomial(2n+1,n-4).

Original entry on oeis.org

1, 11, 78, 455, 2380, 11628, 54264, 245157, 1081575, 4686825, 20030010, 84672315, 354817320, 1476337800, 6107086800, 25140840660, 103077446706, 421171648758, 1715884494940, 6973199770790, 28277527346376, 114456658306760, 462525733568080, 1866442158555975

Offset: 4

N. J. A. Sloane

nonn

Robert Israel, Table of n, a(n) for n = 4..1661
Milan Janjic, Two Enumerative Functions.

Diagonal 10 of triangle A100257.
Fifth unsigned column (s=4) of A113187. - Wolfdieter Lang, Oct 19 2012
Cf. A001622.
Cf. binomial(2*n+m, n): A000984 (m = 0), A001700 (m = 1), A001791 (m = 2), A002054 (m = 3), A002694 (m = 4), A003516 (m = 5), A002696 (m = 6), A030053 - A030056, A004310 - A004318.

seq(binomial(2*n+1,n-4),n=4..50); # Robert Israel, Jun 11 2019

Table[Binomial[2n+1,n-4],{n,4,40}]  (* Harvey P. Dale, Mar 31 2011 *)

vector(30, n, m=n+4; binomial(2*m+1,m-4)) \\ Michel Marcus, Aug 11 2015

G.f.: x^4*512/((1-sqrt(1-4*x))^9*sqrt(1-4*x))+(-1/x^5+7/x^4-15/x^3+10/x^2-1/x). - Vladimir Kruchinin, Aug 11 2015
From Robert Israel, Jun 11 2019: (Start)
(54 + 36*n)*a(n) + (-438 - 129*n)*a(n + 1) + (714 + 138*n)*a(n + 2) + (-432 - 63*n)*a(n + 3) + (110 + 13*n)*a(n + 4) + (-10 - n)*a(n + 5) = 0.
a(n) ~ 2^(2*n+1)/sqrt(n*Pi). (End)
From Amiram Eldar, Jan 24 2022: (Start)
Sum_{n>=4} 1/a(n) = 317/210 - 2*Pi/(9*sqrt(3)).
Sum_{n>=4} (-1)^n/a(n) = 2908*log(phi)/(5*sqrt(5)) - 8697/70, where phi is the golden ratio (A001622). (End)
G.f.: 2F1([11/2,5],[10],4*x). - Karol A. Penson, Apr 24 2024
From Peter Bala, Oct 13 2024: (Start)
a(n) = Integral_{x = 0..4} x^n * w(x) dx, where the weight function w(x) = 1/(2*Pi) * sqrt(x)*(x^4 - 9*x^3 + 27*x^2 - 30*x + 9)/sqrt((4 - x)).
G.f. x^4 * B(x) * C(x)^9, where B(x) = 1/sqrt(1 - 4*x) is the g.f. of the central binomial coefficients A000984 and C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108. (End)
D-finite with recurrence -(n+5)*(n-4)*a(n) +2*n*(2*n+1)*a(n-1)=0. - R. J. Mathar, Nov 22 2024

A067310 Square table read by antidiagonals of number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords).

Original entry on oeis.org

1, 0, 1, 0, 0, 2, 0, 0, 1, 5, 0, 0, 0, 6, 14, 0, 0, 0, 3, 28, 42, 0, 0, 0, 1, 28, 120, 132, 0, 0, 0, 0, 20, 180, 495, 429, 0, 0, 0, 0, 10, 195, 990, 2002, 1430, 0, 0, 0, 0, 4, 165, 1430, 5005, 8008, 4862, 0, 0, 0, 0, 1, 117, 1650, 9009, 24024, 31824, 16796, 0, 0, 0, 0, 0, 70, 1617

Offset: 0

Henry Bottomley, Jan 14 2002

Row sums are A001147 (Double factorial).

Columns include A000108 (Catalan) for k=0 and A002694 for k=1.

			Rows start:
   1,  0,  0,  0,  0,  0,  0, ...;
   1,  0,  0,  0,  0,  0,  0, ...;
   2,  1,  0,  0,  0,  0,  0, ...;
   5,  6,  3,  1,  0,  0,  0, ...;
  14, 28, 28, 20, 10,  4,  1, ...; etc.,
i.e., there are 5 ways of arranging 3 chords with no intersections, 6 with one, 3 with two and 1 with three.

H. Bottomley, Illustration for A000108, A001147, A002694, A067310 and A067311
J. Touchard, Sur un problème de configurations et sur les fractions continues, Canad. J. Math., 4 (1952), 2-25, g_n(x).
alt.math.recreational discussion

A067311 has a different view of the same table.

T(n,k) = Sum_{j=0..n-1} (-1)^j * C((n-j)*(n-j+1)/2-1-k, n-1) * (C(2n, j) - C(2n, j-1)) where C(r,s)=binomial(r,s) if r>=s>=0 and 0 otherwise.

cp's OEIS Frontend

A002696 Binomial coefficients C(2n,n-3).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A062991 Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A030053 a(n) = binomial(2n+1,n-3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A067311 Triangle read by rows: T(n,k) gives number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords) - positive values only.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A004321 Binomial coefficient C(3n, n-3).

Views

Author

Keywords

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A062344 Triangle of binomial(2*n, k) with n >= k.

Views

Author

Keywords

Comments

Examples

A094385 Triangle read by rows: T(n, k) = binomial(2n, k-1)binomial(2*n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0^n.