A274404 -id:A274404 - cp's OEIS frontend

A230823 Number of modified skew Dyck paths of semilength n.

1, 1, 2, 6, 20, 73, 281, 1124, 4627, 19474, 83421, 362528, 1594389, 7083078, 31738724, 143281473, 651048571, 2975243348, 13665866849, 63055369522, 292130900461, 1358415528683, 6337824891559, 29660089051015, 139193062791189, 654903798282528, 3088627236146085

Offset: 0

David Scambler and Alois P. Heinz, Oct 31 2013

nonn

A modified skew Dyck path is a path in the first quadrant which begins at the origin, ends on the x-axis, consists of steps U=(1,1) (up), D=(1,-1) (down) and A=(-1,1) (anti-down) so that A and D steps do not overlap.

			a(0) = 1: the empty path.
a(1) = 1: UD.
a(2) = 2: UUDD, UDUD.
a(3) = 6: UUUDDD, UUDUDD, UUDDUD, UAUDDD, UDUUDD, UDUDUD.
a(4) = 20: UUUUDDDD, UUUDUDDD, UUUDDUDD, UUUDDDUD, UUAUDDDD, UUDUUDDD, UUDUDUDD, UUDUDDUD, UUDDUUDD, UUDDUDUD, UAUUDDDD, UAUDUDDD, UAUDDUDD, UAUDDDUD, UDUUUDDD, UDUUDUDD, UDUUDDUD, UDUAUDDD, UDUDUUDD, UDUDUDUD.
a(5) = 73: UUUUUDDDDD, UUUUDUDDDD, UUUUDDUDDD, ..., UDUDUAUDDD, UDUDUDUUDD, UDUDUDUDUD.

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

Cf. A000108, A128714.

Row sums of A274372 and of A274404.

b:= proc(x, y, t, n) option remember; `if`(y>n, 0,
      `if`(n=y, `if`(t=2, 0, 1), b(x+1, y+1, 0, n-1)+
      `if`(t<>1 and x>0, b(x-1, y+1, 2, n-1), 0)+
      `if`(t<>2 and y>0, b(x+1, y-1, 1, n-1), 0)))
    end:
a:= n-> b(0$3, 2*n):
seq(a(n), n=0..30);

b[x_, y_, t_, n_] := b[x, y, t, n] = If[y > n, 0, If[n == y, If[t == 2, 0, 1], b[x+1, y+1, 0, n-1] + If[t != 1 && x > 0, b[x-1, y+1, 2, n-1], 0] + If[t != 2 && y > 0, b[x+1, y-1, 1, n-1], 0]] ]; a[n_] := b[0, 0, 0, 2*n]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Dec 16 2013, translated from Maple *)

a(n) ~ c * 5^n / n^(3/2), where c = 0.27726256768213709977373928535... . - Vaclav Kotesovec, Jul 16 2014

G.f.: 1/(1 - x/(1 - (x + x^2)/(1 - (x + x^2 + x^3)/(1 - (x + x^2 + x^3 + x^4)/(1 - ...))))), a continued fraction (conjecture). - Ilya Gutkovskiy, Jun 08 2017

A074922 Number of ways of arranging n chords on a circle (handshakes between 2n people across a table) with exactly 2 simple intersections.

Original entry on oeis.org

0, 0, 0, 3, 28, 180, 990, 5005, 24024, 111384, 503880, 2238390, 9806280, 42493880, 182530530, 778439025, 3300049200, 13919756400, 58462976880, 244639718730, 1020422356200, 4244365452600, 17610393500700, 72907029092898

Offset: 0

Henry Bottomley, Oct 06 2002

			a(3)=3 since the only possibility is to have one of the three chords intersected by the other two.

Anwar Al Ghabra, K. Gopala Krishna, Patrick Labelle, and Vasilisa Shramchenko, Enumeration of multi-rooted plane trees, arXiv:2301.09765 [math.CO], 2023.
Vincent Pilaud and Juanjo Rué, Analytic combinatorics of chord and hyperchord diagrams with k crossings, arXiv preprint arXiv:1307.6440, 2013
Henry Bottomley, Illustration for A000108, A001147, A002694, A067310 and A067311
N. J. Wildberger and Dean Rubine, A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode, Amer. Math. Monthly (2025). See section 12.

Cf. A067310, A002694, A232224, A274404.

Table[Binomial[2n,n-2] (n-2)/2,{n,0,30}] (* Harvey P. Dale, Nov 04 2011 *)

a(n) = C(2n, n-2)*(n-2)/2 = A002694(n)*(n-2)/2 = A067310(n, 2) = Sum_{0<=j

A232224 Number of ways of arranging n chords on a circle (handshakes between 2n people across a table) with exactly 3 simple intersections.

Original entry on oeis.org

0, 0, 0, 1, 20, 195, 1430, 9009, 51688, 278460, 1434120, 7141530, 34648856, 164663785, 769491450, 3546222225, 16152872400, 72846725160, 325722299760, 1445598337950, 6373942543800, 27942072562950, 121863923024844, 529043313674106, 2287209524819120

Offset: 0

N. J. A. Sloane, Nov 22 2013

nonn

Lars Blomberg, Table of n, a(n) for n = 0..100
V. Pilaud, J. Rué, Analytic combinatorics of chord and hyperchord diagrams with k crossings, arXiv preprint arXiv:1307.6440 [math.CO], 2013.

Cf. A002694, A074922, A274404.

CoefficientList[Series[(1 - Sqrt[1 - 4 x^2])^6 ((1 - x^2) Sqrt[1 - 4 x^2] + 7 x^2 - 26 x^4)/(64 x^6 Sqrt[1 - 4 x^2]^5), {x, 0, 48}], x^2] (* Michael De Vlieger, Sep 30 2015 *)

lista(nn) = {np = 2*nn+2; default(seriesprecision, np); pol = (1-sqrt(1-4*x^2))^6*((1-x^2)*sqrt(1-4*x^2)+7*x^2-26*x^4)/(64*x^6*sqrt(1-4*x^2)^5) + O(x^(np)); forstep (n=0, 2*nn, 2, print1(polcoeff(pol, n), ", "););} \\ Michel Marcus, Sep 30 2015

x='x+O('x^33); concat([0,0,0],Vec((1-sqrt(1-4*x))^6*((1-x)*sqrt(1-4*x)+7*x-26*x^2) / (64*x^3*sqrt(1-4*x)^5))) \\ Joerg Arndt, Sep 30 2015

Pilaud-Rue give an explicit g.f.

a(n) = [x^(2n)] (1-sqrt(1-4*x^2))^6*((1-x^2)*sqrt(1-4*x^2)+7*x^2-26*x^4) / (64*x^6*sqrt(1-4*x^2)^5). - Michel Marcus, Sep 30 2015

Corrected initial terms and more terms from Lars Blomberg, Sep 30 2015

A274405 Number of anti-down steps in all modified skew Dyck paths of semilength n.

Original entry on oeis.org

0, 0, 0, 1, 6, 34, 179, 915, 4607, 22988, 114090, 564359, 2785921, 13735074, 67665208, 333211828, 1640575047, 8077199130, 39770520844, 195852723348, 964689515033, 4752800817185, 23422061819883, 115456855588378, 569293729146929, 2807864888917275

Offset: 0

Alois P. Heinz, Jun 20 2016

nonn

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

Cf. A230823, A274404.

b:= proc(x, y, t, n) option remember; `if`(y>n, 0, `if`(n=y,
      `if`(t=2, 0, [1, 0]), b(x+1, y+1, 0, n-1)+`if`(t<>1
       and x>0, (p-> p+[0, p[1]])(b(x-1, y+1, 2, n-1)), 0)+
      `if`(t<>2 and y>0, b(x+1, y-1, 1, n-1), 0)))
    end:
a:= n-> b(0$3, 2*n)[2]:
seq(a(n), n=0..30);

b[x_, y_, t_, n_] := b[x, y, t, n] = If[y > n, 0, If[n == y, If[t == 2, {0, 0}, {1, 0}], b[x + 1, y + 1, 0, n - 1] + If[t != 1 && x > 0, Function[p, p + {0, p[[1]]}][b[x - 1, y + 1, 2, n - 1]], 0] + If[t != 2 && y > 0, b[x + 1, y - 1, 1, n - 1], 0]]];
a[n_] := b[0, 0, 0, 2 n][[2]];
a /@ Range[0, 30] (* Jean-François Alcover, Dec 29 2020, after Alois P. Heinz *)

a(n) = Sum_{k>0} k * A274404(n,k).

a(n) ~ c * 5^n / sqrt(n), where c = 0.0554525135364274199547478570703521322323... . - Vaclav Kotesovec, Jun 26 2016

Showing 1-4 of 4 results.

cp's OEIS Frontend

A230823 Number of modified skew Dyck paths of semilength n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A074922 Number of ways of arranging n chords on a circle (handshakes between 2n people across a table) with exactly 2 simple intersections.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A232224 Number of ways of arranging n chords on a circle (handshakes between 2n people across a table) with exactly 3 simple intersections.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A274405 Number of anti-down steps in all modified skew Dyck paths of semilength n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula