|
|
A342556
|
|
a(n) is the number of unlabeled connected graphs without endpoints with n edges.
|
|
6
|
|
|
1, 0, 0, 1, 1, 2, 5, 9, 22, 60, 164, 494, 1624, 5602, 20600, 79813, 323806, 1371025, 6034105, 27513424, 129641411, 629862824, 3149541908, 16183100922, 85328280263, 461123500894, 2551342936264, 14438734591483, 83506198920054, 493163726073210, 2971858162771887
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
Brendan McKay and Adolfo Piperno, nauty and Traces, programs for computing automorphism groups of graphs and digraphs.
|
|
FORMULA
|
Inverse Euler transform of A369290.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|