OFFSET
1,4
COMMENTS
Euler transform of A241841. Here the graphs are simple (no loops, no multi-edges) but not necessarily connected.
LINKS
Georg Fischer, Table of n, a(n) for n = 1..40
EXAMPLE
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).
a(8) = 11122 counts A241841(8) = 11094 graphs with one component and 28 graphs with two components.
a(9) = 261212 counts A241841(9) = 261033 graphs with one component, 178 graphs with two components, and 1 graph with 3 components.
CROSSREFS
KEYWORD
nonn
AUTHOR
R. J. Mathar, Jun 16 2018
EXTENSIONS
a(19) corrected by Georg Fischer, Dec 20 2022
STATUS
approved