OFFSET
1,4
COMMENTS
These are the connected graphs that are neither trees nor unicyclic.
Also connected non-choosable graphs covering n vertices, where a graph is choosable iff it is possible to choose a different vertex from each edge. The unlabeled version is A140636. The complement is counted by A129271. - Gus Wiseman, Feb 20 2024
REFERENCES
J. Riordan, An Introduction to Combinatorial Analysis, Dover, 2002, p. 2.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..50
MATHEMATICA
csm[s_]:=With[{c=Select[Subsets[Range[Length[s]], {2}], 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[csm[#]]<=1&&Select[Tuples[#], UnsameQ@@#&]=={}&]], {n, 0, 5}] (* Gus Wiseman, Feb 19 2024 *)
PROG
(PARI) seq(n)={my(A=O(x*x^n), t=-lambertw(-x + A)); Vec(serlaplace( log(sum(k=0, n, 2^binomial(k, 2)*x^k/k!, A)) - log(1/(1-t))/2 - t/2 + 3*t^2/4), -n)} \\ Andrew Howroyd, Jan 15 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Washington Bomfim, May 21 2008
EXTENSIONS
Definition clarified by Andrew Howroyd, Jan 15 2022
STATUS
approved