[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A045744
Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.
3
1, 4, 22, 141, 988, 7337, 56749, 452332, 3689697, 30652931, 258465558, 2206330790, 19029531220, 165582392070, 1451789520435, 12813638048184, 113755675163767, 1015119850103821, 9100463691522759, 81923222827031025
OFFSET
2,2
LINKS
FORMULA
a(n) = Sum_{i=0..floor((n-2)/3)} binomial(n-2+i, i)*binomial(4*n-4-i, n-2-3*i)/(n-1).
PROG
(PARI) a(n) = if(n>1, sum(i=0, floor((n-2)/3), binomial(n-2+i, i)*binomial(4*n-4-i, n-2-3*i))/(n-1)); \\ Andrew Howroyd, Nov 12 2017
CROSSREFS
Column k=0 of A094046.
Cf. A045743.
Sequence in context: A227404 A366677 A190271 * A369504 A243626 A369485
KEYWORD
nonn
STATUS
approved