A007297 -id:A007297 - cp's OEIS frontend

A365843 Expansion of (1/x) * Series_Reversion( x*(1-x)^3/(1+x)^3 ).

1, 6, 54, 578, 6810, 85278, 1113854, 15004746, 206955378, 2908113974, 41484917958, 599202514578, 8745727050762, 128790559374030, 1911191826600462, 28551332345784730, 429040549473424866, 6480799118506040934, 98349636147075506006, 1498732955394826784226

Offset: 0

Seiichi Manyama, Sep 20 2023

nonn

Column k=3 of A378238.
Cf. A007297, A365842, A365844, A365845.
Cf. A032349, A365622, A365847.
Cf. A144097.

a(n) = sum(k=0, n, binomial(3*n+k+2, k)*binomial(3*(n+1), n-k))/(n+1);

a(n) = (1/(n+1)) * Sum_{k=0..n} binomial(3*n+k+2,k) * binomial(3*(n+1),n-k).
G.f.: B^3, where B is the g.f. of A144097.
a(n) ~ sqrt(8060 + 2651*sqrt(10)) * (223 + 70*sqrt(10))^n / (2 * sqrt(5*Pi) * n^(3/2) * 3^(3*n + 5/2)). - Vaclav Kotesovec, Nov 28 2024

A324328 Number of topologically connected chord graphs on a subset of {1,...,n}.

Original entry on oeis.org

1, 1, 2, 4, 8, 27, 354

Offset: 0

Gus Wiseman, Feb 22 2019

A graph is topologically connected if the graph whose vertices are the edges and whose edges are crossing pairs of edges is connected, where two edges cross each other if they are of the form {{x,y},{z,t}} with x < z < y < t or z < x < t < y.

			The a(0) = 1 through a(5) = 27 graphs:
  {}  {}  {}      {}      {}          {}
          {{12}}  {{12}}  {{12}}      {{12}}
                  {{13}}  {{13}}      {{13}}
                  {{23}}  {{14}}      {{14}}
                          {{23}}      {{15}}
                          {{24}}      {{23}}
                          {{34}}      {{24}}
                          {{13}{24}}  {{25}}
                                      {{34}}
                                      {{35}}
                                      {{45}}
                                      {{13}{24}}
                                      {{13}{25}}
                                      {{14}{25}}
                                      {{14}{35}}
                                      {{24}{35}}
                                      {{13}{14}{25}}
                                      {{13}{24}{25}}
                                      {{13}{24}{35}}
                                      {{14}{24}{35}}
                                      {{14}{25}{35}}
                                      {{13}{14}{24}{25}}
                                      {{13}{14}{24}{35}}
                                      {{13}{14}{25}{35}}
                                      {{13}{24}{25}{35}}
                                      {{14}{24}{25}{35}}
                                      {{13}{14}{24}{25}{35}}

Cf. A000108, A000699, A001764, A002061, A007297, A016098, A054726 (non-crossing chord graphs), A099947, A136653, A268814.

Cf. A324168, A324169, A324172, A324173, A324323, A324327 (covering case).

croXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
crosscmpts[stn_]:=csm[Union[Subsets[stn,{1}],Select[Subsets[stn,{2}],croXQ]]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Length[crosscmpts[#]]<=1&]],{n,0,5}]

Binomial transform of A324327.

A061162 a(n) = (6n)!n!/((3n)!(2n)!^2).

Original entry on oeis.org

1, 30, 2310, 204204, 19122246, 1848483780, 182327718300, 18236779032600, 1842826521244230, 187679234340049620, 19232182592635611060, 1980665038436368775400, 204826599735691440534300, 21255328931341321610645544, 2212241139727064219063537016

Offset: 0

Richard Stanley, Apr 17 2001

According to page 781 of the cited reference the generating function F(x) for a(n) is algebraic but not obviously so and the minimal polynomial satisfied by F(x) is quite large.

This sequence is the particular case a = 3, b = 1 of the following result (see Bober, Theorem 1.2): let a, b be nonnegative integers with a > b and gcd(a,b) = 1. Then (2*a*n)!*(b*n)!/((a*n)!*(2*b*n)!*((a-b)*n)!) is an integer for all integer n >= 0. Other cases include A211419 (a = 3, b = 2), A211420 (a = 4, b = 1) and A211421 (a = 4, b = 3) and A061163 (a = 5, b = 1). The o.g.f. Sum_{n >= 1} a(n)*z^n is algebraic over the field of rational functions Q(z) (see Rodriguez-Villegas). - Peter Bala, Apr 10 2012

M. Kontsevich and D. Zagier, Periods, in Mathematics Unlimited - 2001 and Beyond, Springer, Berlin, 2001, pp. 771-808.
R. P. Stanley, Enumerative Combinatorics Volume 2, Cambridge Univ. Press, 1999, Theorem 6.33, p. 197.

Harry J. Smith, Table of n, a(n) for n = 0..100
J. W. Bober, Factorial ratios, hypergeometric series, and a family of step functions, 2007, arXiv:0709.1977 [math.NT], 2007; J. London Math. Soc., Vol. 79, Issue 2, (2009) 422-444.
M. Kontsevich and D. Zagier, Periods, Institut des Hautes Etudes Scientifiques 2001 IHES/M/01/22, p. 11.
W. Mlotkowski and Karol A. Penson, Probability distributions with binomial moments, arXiv preprint arXiv:1309.0595 [math.PR], 2013.
F. Rodriguez-Villegas, Integral ratios of factorials and algebraic hypergeometric functions, arXiv:math/0701362 [math.NT], 2007.

Cf. A061163, A061164, A007297, A091527, A262732.

See also A091527, A211419, A211420, A211421.

A061162 := n->(6*n)!*n!/((3*n)!*(2*n)!^2);

a[n_] := 16^n Gamma[3 n + 1/2]/(Gamma[n + 1/2] Gamma[2 n + 1]);
Table[a[n], {n, 0, 14}] (* Peter Luschny, Mar 01 2018 *)

{ for (n=0, 100, write("b061162.txt", n, " ", (6*n)!*n!/((3*n)!*(2*n)!^2)) ) } \\ Harry J. Smith, Jul 18 2009

a(n) ~ 1/2*Pi^(-1/2)*n^(-1/2)*2^(2*n)*3^(3*n)*{1 - 1/72*n^-1 + ...}. - Joe Keane (jgk(AT)jgk.org), Jun 11 2002
n*(2*n-1)*a(n) -6*(6*n-1)*(6*n-5)*a(n-1)=0. - R. J. Mathar, Oct 26 2014
From Peter Bala, Aug 21 2016: (Start)
a(n) = Sum_{k = 0..2*n} binomial(6*n, k)*binomial(4*n - k - 1, 2*n - k).
a(n) = Sum_{k = 0..n} binomial(8*n, 2*n - 2*k)*binomial(2*n + k - 1, k).
O.g.f. A(x) = Hypergeom([5/6, 1/6], [1/2], 108*x).
a(n) = [x^(2*n)] H(x)^n, where H(x) = (1 + x)^6/(1 - x)^2. Cf. A091496 and A262732. It follows that the o.g.f. A(x) for this sequence is the diagonal of the bivariate rational generating function 1/2*( 1/(1 - t*H(sqrt(x))) + 1/(1 - t*H(-sqrt(x))) ) and hence is algebraic by Stanley 1999, Theorem 6.33, p. 197.
Let G(x) = 1/x * series reversion( x*(1 - x)/(1 + x)^3 ) = 1 + 4*x + 23*x^2 + 156*x^3 + 1162*x^4 + ..., essentially the o.g.f. for A007297. Then A(x^2) equals the even part of 1 + x*(d/dx log(G(x))).
exp(Sum_{n >= 1} a(n)*x^n/n) = F(x), where F(x) = 1 + 30*x + 1605*x^2 + 107218*x^3 + 8043114*x^4 + 647773116*x^5 + 54730094637*x^6 + ... has integer coefficients since F(x^2) = G(x)*G(-x). Furthermore, F(x)^(1/6) = 1 + 5*x + 205*x^2 + 12328*x^3 + 874444*x^4 + 68022261*x^5 + 5613007167*x^6 + ... appears to have all integer coefficients. (End)
a(n) is the n-th moment of the positive weight function w(x) on x = (0,108), i.e.: a(n) = Integral_{x=0..108} x^n*w(x) dx, n >= 0, where w(x) = sqrt(3)*(1 + sqrt(1 - x/108))^(2/3)/(12*2^(1/3)*Pi*x^(5/6)*sqrt(1 - x/108)) + 2^(4/3)*sqrt(3)/(864*Pi*x^(1/6)*(1 + sqrt(1 - x/108))^(2/3)*sqrt(1 - x/108)). The weight function w(x) is singular at x=0 and at x=108 and is the solution of the Hausdorff moment problem. This solution is unique. - Karol A. Penson, Mar 01 2018
a(n) = 2^(4*n)*binomial(-n-1/2, 2*n). - Ira M. Gessel, Jan 04 2025

A263843 Reversion of g.f. for A162395 (squares with signs).

Original entry on oeis.org

0, 1, 4, 23, 156, 1162, 9192, 75819, 644908, 5616182, 49826712, 448771622, 4092553752, 37714212564, 350658882768, 3285490743987, 30989950019532, 294031964658430, 2804331954047160, 26870823304476690, 258548658860327880, 2497104592420003980, 24199830095943069360, 235254163727798051070

Offset: 0

N. J. A. Sloane, Nov 05 2015

This is a variant of A007297, which is the main entry, with many references to both versions.
From Peter Bala, Apr 07 2020: (Start)
Let A(x) = 1 + 4*x + 23*x^2 + ... denote the o.g.f. of this sequence taken with an offset of 0. The sequence defined by b(n) := [x^n] A(x)^n for n >= 0 begins [1, 4, 62, 1084, 19982, 379504, 7347410, 144168392, 2856907662, 57044977168, 1145905776312, 23131265652092, ...]. We conjecture that the supercongruences b(n*p^k) == b(n*p^(k-1)) ( mod p^(3*k) ) hold for prime p >= 3 and all positive integers n and k.
More generally, for a positive integer r and integer s, the sequence {b(r,s;n) : n >= 0} defined by b(r,s;n) := [x^(r*n)] A(x)^(s*n) is conjectured to satisfy the same supercongruences. (End)

Cf. A162395.

A variant of A007297.

with(gfun); t1:=(x-x^2)/(1+x)^3; t2:=series(t1,x,50); t3:=seriestoseries(t2, 'revogf'); seriestolist(%);

CoefficientList[InverseSeries[Series[x*(1-x)/(1+x)^3, {x, 0, 30}], x], x] (* Vaclav Kotesovec, Nov 11 2017 *)

a(n) ~ sqrt(7 - 4*sqrt(3)) * 2^(n-1/2) * 3^(3*n/2) / (sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Nov 11 2017
D-finite with recurrence n*(n+1)*a(n) -18*n*(n-2)*a(n-1) +12*(-9*n^2+18*n-14)*a(n-2) +216*(3*n-7)*(3*n-8)*a(n-3)=0. - R. J. Mathar, Mar 24 2023
From Ilya Gutkovskiy, Sep 26 2023: (Start)
G.f. A(x) satisfies: A(x) = x * (1 + A(x))^3 / (1 - A(x)).
a(n) = (1/n) * Sum_{k=0..n-1} binomial(n+k-1,k) * binomial(3*n,n-k-1) for n > 0. (End)

A107111 Number array whose rows are the series reversions of x(1-x)/(1+x)^k, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 3, 6, 5, 1, 4, 13, 22, 14, 1, 5, 23, 67, 90, 42, 1, 6, 36, 156, 381, 394, 132, 1, 7, 52, 305, 1162, 2307, 1806, 429, 1, 8, 71, 530, 2833, 9192, 14589, 8558, 1430, 1, 9, 93, 847, 5919, 27916, 75819, 95235, 41586, 4862, 1, 10, 118, 1272, 11070, 70098, 286632, 644908, 636925, 206098, 16796

Offset: 0

Paul Barry, May 12 2005

First row is the Catalan numbers A000108, second row is the large Schroeder numbers A006318, third row is A062992, fourth row is A007297. As a number triangle, this is T(n,k)=if(k<=n,sum{j=0..k, binomial((n-k)(k+1),k-j)*binomial(k+j,j)}/(k+1),0) with row sums A107112 and diagonal sums A107113.

			Array begins
1,1,2,5,14,42,132,...
1,2,6,22,90,394,1806,...
1,3,13,67,381,2307,14589,...
1,4,23,156,1162,9192,75819,...

Cf. A366012.

A107111 := proc(n,k)
    add(binomial(n*(k+1),k-j)*binomial(k+j,j),j=0..k);
    %/(k+1) ;
end proc: # R. J. Mathar, Aug 02 2016

T[n_, k_] := Sum[Binomial[n (k + 1), k - j] Binomial[k + j, j], {j, 0, k}]/(k + 1);
Table[T[n - k, k], {n, 0, 10}, {k, 0, n}] // Flatten (* Jean-François Alcover, Feb 21 2020 *)

T(n, k)=sum{j=0..k, binomial(n(k+1), k-j)*binomial(k+j, j)}/(k+1)

A162395 a(n) = -(-1)^n * n^2.

Original entry on oeis.org

1, -4, 9, -16, 25, -36, 49, -64, 81, -100, 121, -144, 169, -196, 225, -256, 289, -324, 361, -400, 441, -484, 529, -576, 625, -676, 729, -784, 841, -900, 961, -1024, 1089, -1156, 1225, -1296, 1369, -1444, 1521, -1600, 1681, -1764, 1849, -1936, 2025, -2116, 2209, -2304, 2401, -2500

Offset: 1

Michael Somos, Jul 02 2009

This sequence is the denominator of (Pi^2)/12 = 1/1-1/4+1/9-1/16+1/25-1/36+... - Mohammad K. Azarian, Dec 29 2011

Also, circulant determinant of [1,2,...,n,n-1,...,1], i.e., determinant of the (2n-1) X (2n-1) matrix which has this as first row (and also first column), where row k+1 is obtained by cyclically shifting row k one place to the left. - M. F. Hasler, Dec 17 2016

			G.f. = x - 4*x^2 + 9*x^3 - 16*x^4 + 25*x^5 - 36*x^6 + 49*x^7 - 64*x^8 + 81*x^9 + ...

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Michael Somos, Rational Function Multiplicative Coefficients.
Index entries for linear recurrences with constant coefficients, signature (-3,-3,-1).

Cf. A000290, A072691.

For the reversion of this sequence see A263843 (and also A007297).

[(-1)^(n+1) * n^2: n in [1..60]]; // Vincenzo Librandi, Feb 15 2013

Table[(-1)^(n+1) * n^2, {n, 60}] (* Vincenzo Librandi, Feb 15 2013 *)

PARI
```
{a(n) = -(-1)^n * n^2};
```

Euler transform of length 2 sequence [-4, 3].
a(n) is multiplicative with a(2^e) = -(4^e) if e>0, a(p^e) = (p^2)^e if p>2.
G.f.: x * (1 - x) / (1 + x)^3.
E.g.f.: exp(-x) * (x - x^2).
a(n) = a(-n) = -(-1)^n * A000290(n) for all n in Z.
Sum_{n>=1} 1/a(n) = Pi^2/12 (A072691). - Amiram Eldar, Dec 10 2022
Dirichlet g.f.: zeta(s-2)*(1-2^(3-s)) = DirichletEta(s-2). - Amiram Eldar, Jan 07 2023

A326329 Number of simple graphs covering {1..n} with no crossing or nesting edges.

Original entry on oeis.org

1, 0, 1, 4, 13, 44, 149, 504, 1705, 5768, 19513, 66012

Offset: 0

Gus Wiseman, Jun 27 2019

Covering means there are no isolated vertices. Two edges {a,b}, {c,d} are crossing if a < c < b < d or c < a < d < b, and nesting if a < c < d < b or c < a < b < d.

Is this (apart from offsets) the same as A073717? - R. J. Mathar, Jul 04 2019

Eric Marberg, Crossings and nestings in colored set partitions, arXiv preprint arXiv:1203.5738 [math.CO], 2012.
Gus Wiseman, The a(5) = 44 covering simple graphs with no crossing or nesting edges.

The case for set partitions is A001519.
Covering simple graphs are A006129.
The case with just nesting or just crossing edges forbidden is A324169.
The binomial transform is the non-covering case A326244.
Cf. A000108, A006125, A007297, A054726, A099947, A324327, A326279, A326293.

Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Union@@#==Range[n]&&!MatchQ[#,{_,{x_,y_},_,{z_,t_},_}/;x

A089434 Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....

Original entry on oeis.org

1, 3, 1, 12, 9, 2, 55, 66, 30, 5, 273, 455, 315, 105, 14, 1428, 3060, 2856, 1428, 378, 42, 7752, 20349, 23940, 15960, 6300, 1386, 132, 43263, 134596, 191268, 159390, 83490, 27324, 5148, 429, 246675, 888030, 1480050, 1480050, 965250, 418275, 117117

Offset: 2

Emeric Deutsch, Dec 28 2003

			T(4,1)=9 because, considering the complete graph K_4 on the nodes A,B,C and D, we obtain a non-crossing connected graph on A,B,C,D, with exactly one interior face, by deleting either both diagonals AC and BD (1 case) or deleting one of the two diagonals and one of the four sides (8 cases).
Triangle starts:
   1;
   3,  1;
  12,  9,  2;
  55, 66, 30, 5;
  ... - _Michel Marcus_, Apr 09 2013

Andrew Howroyd, Table of n, a(n) for n = 2..1276
P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Math., 204, 203-229, 1999.
V. Pilaud, J. Rue, Analytic combinatorics of chord and hyperchord diagrams with k crossings, Adv. Appl. Math. 57 (2014) 60-100, equation (3).

T(n, n-2) yields the Catalan numbers (A000108) corresponding to triangulations, T(n, 0) yields the ternary numbers (A001764) corresponding to noncrossing trees, T(n, 1) yields A003408, row sums yield A007297. Sum(kT(n, k), k=0..n-2) yields A045742.
Columns k=0..2 are A001764, A003408, A089433.
Cf. A007297, A000108, A108410.

t[n_, k_] = Binomial[n + k - 2, k] Binomial[3 n - 3, n - 2 - k]/(n - 1) ; Flatten[Table[t[n, k], {n, 2, 10}, {k, 0, n - 2}]][[;; 43]]
(* Jean-François Alcover, Jun 30 2011 *)

T(n, k)={binomial(n+k-2, k)*binomial(3*n-3, n-2-k)/(n-1)}
for(n=2, 10, for(k=0, n-2, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 17 2017

T(n, k) = binomial(n+k-2, k)*binomial(3*n-3, n-2-k)/(n-1), 0 <= k <= n-2.
G.f.: G(t, z) satisfies G^3 + t*G^2 - (1+2*t)*z*G+(1+t)*z^2 = 0.
O.g.f. equals the series reversion w.r.t. x of x*(1-x*t)/(1+x)^3. If R(n,t) is the n-th row polynomial of this triangle then R(n,t-1) is the n-th row polynomial of A108410. - Peter Bala, Jul 15 2012

Keyword tabl added by Michel Marcus, Apr 09 2013

Offset corrected by Andrew Howroyd, Nov 17 2017

A326330 Number of simple graphs with vertices {1..n} whose nesting edges are connected.

Original entry on oeis.org

1, 1, 2, 4, 8, 30, 654

Offset: 0

Gus Wiseman, Jun 27 2019

Two edges {a,b}, {c,d} are nesting if a < c < d < b or c < a < b < d. A graph has its nesting edges connected if the graph whose vertices are the edges and whose edges are nesting pairs of edges is connected.

Gus Wiseman, The a(5) = 30 nesting-connected simple graphs.

The covering case is the inverse binomial transform A326331.
Graphs whose crossing edges are connected are A324328.
Cf. A006125, A007297, A054726, A099947, A117662, A136653, A324328.
Cf. A326210, A326293, A326335, A326336, A326337, A326338, A326339.

nesXQ[stn_]:=MatchQ[stn,{_,{x_,y_},_,{z_,t_},_}/;x0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Length[nestcmpts[#]]<=1&]],{n,0,5}]

A326337 Number of simple graphs covering the vertices {1..n} whose weakly nesting edges are connected.

Original entry on oeis.org

1, 0, 1, 3, 29, 595, 23437

Offset: 0

Gus Wiseman, Jun 28 2019

Two edges {a,b}, {c,d} are weakly nesting if a <= c < d <= b or c <= a < b <= d. A graph has its weakly nesting edges connected if the graph whose vertices are the edges and whose edges are weakly nesting pairs of edges is connected.

Gus Wiseman, The a(4) = 29 covering simple graphs whose weakly nesting edges are connected.

The binomial transform is the non-covering case A326338.
The non-weak case is A326331.
Simple graphs whose nesting edges are connected are A326330.
Cf. A006125, A007297, A054726, A099947, A136653.
Cf. A324169, A324327, A326293, A326294, A326329, A326335, A326336.

wknXQ[stn_]:=MatchQ[stn,{_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;(x<=z&&y>=t)||(x>=z&&y<=t)];
wknestcmpts[stn_]:=csm[Union[List/@stn,Select[Subsets[stn,{2}],wknXQ]]];
csm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[OrderedQ[#],UnsameQ@@#,Length[Intersection@@s[[#]]]>0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Union@@#==Range[n]&&Length[wknestcmpts[#]]<=1&]],{n,0,5}]

cp's OEIS Frontend

A365843 Expansion of (1/x) * Series_Reversion( x*(1-x)^3/(1+x)^3 ).

Views

Author

Keywords

Crossrefs

Programs

PARI

Formula

A324328 Number of topologically connected chord graphs on a subset of {1,...,n}.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A061162 a(n) = (6n)!n!/((3n)!(2n)!^2).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A263843 Reversion of g.f. for A162395 (squares with signs).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Formula

A107111 Number array whose rows are the series reversions of x(1-x)/(1+x)^k, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A162395 a(n) = -(-1)^n * n^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A326329 Number of simple graphs covering {1..n} with no crossing or nesting edges.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A089434 Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....

Views

Author

Keywords

Examples