cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A045744 Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.

This page as a plain text file.
%I A045744 #9 Nov 13 2017 03:13:02
%S A045744 1,4,22,141,988,7337,56749,452332,3689697,30652931,258465558,
%T A045744 2206330790,19029531220,165582392070,1451789520435,12813638048184,
%U A045744 113755675163767,1015119850103821,9100463691522759,81923222827031025
%N A045744 Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.
%H A045744 Andrew Howroyd, <a href="/A045744/b045744.txt">Table of n, a(n) for n = 2..200</a>
%F A045744 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).
%o A045744 (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
%Y A045744 Column k=0 of A094046.
%Y A045744 Cf. A045743.
%K A045744 nonn
%O A045744 2,2
%A A045744 _Emeric Deutsch_