|
|
A304071
|
|
Number of simple connected graphs with n nodes rooted at one non-edge.
|
|
3
|
|
|
0, 0, 1, 6, 42, 402, 5381, 112776, 3935471, 240684836, 26449057257, 5289513580458, 1939502108505917, 1311274498490104492, 1642800188822966309834, 3831285832174735713684706, 16703340559932677463553709189, 136661710199022168890320488632600, 2105815888079982128884579271408161673, 61310553163194788144046000967760340771668
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3)=1: the non-edge joins the two leaves. a(4)=6: quadrangle: the non-edge is a diagonal; triangle with protruding edge: the non-edge joins the leaf with a node of degree 2; quadrangle with diagonal: the non-edge is the other diagonal; tetrahedron: no contribution; linear chain: the non-edge either joins the two leaves or a leaf with a node at distance 2; star graph: the non-edge joins two leaves.
|
|
MATHEMATICA
|
A303830 = Import["https://oeis.org/A303830/b303830.txt", "Table"][[All, 2]];
A303831 = Import["https://oeis.org/A303831/b303831.txt", "Table"][[All, 2]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|