|
|
A010355
|
|
Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n edges.
|
|
11
|
|
|
1, 0, 1, 1, 2, 4, 7, 16, 42, 111, 331, 1094, 3829, 14380, 57069, 237188, 1027929, 4622588, 21494274, 103077677, 508743475, 2579847563, 13422868110, 71570635306, 390670937143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Original name: Single-edge stars with n edges.
|
|
LINKS
|
Brendan McKay and Adolfo Piperno, nauty and Traces, programs for computing automorphism groups of graphs and digraphs.
|
|
EXAMPLE
|
The a(1) = 1 graph is the single edge (K_2 = P_2).
The a(3) = 1 graph is the triangle (K_3).
The a(4) = 1 graph is the square (C_4).
The a(5) = 2 graphs are the cycle C_5 and a cycle of 4 nodes with one diagonal added.
(End)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(13)-a(18) added using data from Robinson's tables by Andrew Howroyd, Nov 23 2020
a(19)-a(22) from Hugo Pfoertner using program geng from nauty, Dec 04 2020
|
|
STATUS
|
approved
|
|
|
|