login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045743 Number of noncrossing connected graphs on n nodes on a circle having no triangular faces. 3
1, 3, 13, 66, 367, 2164, 13293, 84157, 545270, 3598244, 24100375, 163416748, 1119592052, 7738412716, 53894849437, 377851866954, 2664570714233, 18887568709788, 134501247038230, 961774761388430, 6903072966224220 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Andrew Howroyd, Table of n, a(n) for n = 2..200

FORMULA

a(n) = Sum_{i=0..floor((n-2)/2)} binomial(n-2+i, i)*binomial(3*n-3-i, n-2-2*i)/(n-1).

From Paul D. Hanna, Mar 09 2010: (Start)

G.f. A(x): Let F(x) = 1 + A(x)/x = 1 + x + 3*x^2 + 13*x^3 + 66*x^4 +...

then F(x) satisfies: x*F(x)^4 = (1 - F(x))*(1 - 3*F(x) + F(x)^2). (End)

PROG

(PARI) {a(n)=local(A=1+x+x*O(x^n)); for(i=1, n, A=1-x*A^4/(1-3*A+A^2)); polcoeff(A, n)} \\ Paul D. Hanna, Mar 09 2010

(PARI) a(n) = if(n>1, sum(i=0, floor(n/2)-1, binomial(n-2+i, i)*binomial(3*n-3-i, n-2-2*i))/(n-1)); \\ Andrew Howroyd, Nov 12 2017

CROSSREFS

Column k=0 of A089435.

Cf. A045744.

Sequence in context: A228987 A112807 A219537 * A110530 A142979 A302303

Adjacent sequences:  A045740 A045741 A045742 * A045744 A045745 A045746

KEYWORD

nonn

AUTHOR

Emeric Deutsch

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 06:58 EDT 2021. Contains 345098 sequences. (Running on oeis4.)