The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306003 Number of simple graphs on n nodes where each component has at least one cycle. 1

%I

%S 0,0,1,4,18,107,846,11122,261212,11717906,1006716728,164060156360,

%T 50335920919080,29003488522658695,31397381311096116107,

%U 63969560164236980493127,245871831711291931225960094,1787331725280413408599670721723,2463602142946396333256221557990652

%N Number of simple graphs on n nodes where each component has at least one cycle.

%C Euler transform of A241841. Here the graphs are simple (no loops, no multi-edges) but not necessarily connected.

%e a(7)=846 counts A241841(7)=842 graphs with one component plus 4 graphs with two components (the two components being the connected graph on 3 nodes and any of the 4 graphs on 4 nodes).

%e a(8) = 11122 counts A241841(8) = 11094 graphs with one component and 28 graphs with two components.

%e a(9) = 261212 counts A241841(9) = 261033 graphs with one component, 178 graphs with two components, and 1 graph with 3 components.

%Y Cf. A241841 (connected variant), A286743 (at least one component has one cycle).

%K nonn

%O 1,4

%A _R. J. Mathar_, Jun 16 2018

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.

Last modified October 27 22:24 EDT 2021. Contains 348305 sequences. (Running on oeis4.)