|
|
A369196
|
|
Number of labeled loop-graphs with n vertices and at most as many edges as covered vertices.
|
|
10
|
|
|
1, 2, 7, 39, 320, 3584, 51405, 900947, 18661186, 445827942, 12062839691, 364451604095, 12157649050827, 443713171974080, 17583351295466338, 751745326170662049, 34485624653535808340, 1689485711682987916502, 88030098291829749593643, 4860631073631586486397141
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(0) = 1 through a(2) = 7 loop-graphs:
{} {} {}
{{1}} {{1}}
{{2}}
{{1,2}}
{{1},{2}}
{{1},{1,2}}
{{2},{1,2}}
|
|
MATHEMATICA
|
Table[Length[Select[Subsets[Subsets[Range[n], {1, 2}]], Length[#]<=Length[Union@@#]&]], {n, 0, 5}]
|
|
CROSSREFS
|
A006125 counts simple graphs, also loop-graphs if shifted left.
A054548 counts graphs covering n vertices with k edges, with loops A369199.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|