login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280775 Number of monolithic chord diagrams on n nodes. 7
1, 3, 11, 65, 573, 6547, 89639, 1414417, 25148617, 496416579, 10762275539, 254153371121, 6494217863461, 178558132802259, 5257524611172751, 165089697983580641, 5507950426778674129, 194605351254360182403, 7259714571747394749147, 285174902634083710549601 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Gheorghe Coserea, Table of n, a(n) for n = 1..200

Michael Borinsky, Generating asymptotics for factorially divergent sequences, arXiv preprint arXiv:1603.01236 [math.CO], 2016. See M_n.

FORMULA

G.f.: C(x/(1-x)^2), where C(x) is the g.f. for A000699.

MATHEMATICA

terms = 20;

c[_] = 0;

Do[c[x_] = x + x^2*D[c[x]^2/x, x] + O[x]^(terms+1) // Normal, terms];

c[x/(1-x)^2] + O[x]^(terms+1) // CoefficientList[#, x]& // Rest (* Jean-Fran├žois Alcover, Sep 01 2018 *)

PROG

(PARI)

A000699_seq(N) = {

  my(a = vector(N)); a[1] = 1;

  for (n=2, N, a[n] = sum(k=1, n-1, (2*k-1)*a[k]*a[n-k])); a;

};

N = 20; Vec(subst(x*Ser(A000699_seq(N)), x, x/(1-x)^2))  \\ Gheorghe Coserea, Jan 22 2017

CROSSREFS

Cf. A000699.

Sequence in context: A030226 A233099 A132101 * A303341 A077428 A222765

Adjacent sequences:  A280772 A280773 A280774 * A280776 A280777 A280778

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 19 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 11:34 EST 2018. Contains 317133 sequences. (Running on oeis4.)