|
| |
|
|
A369828
|
|
Number of simple graphs on 2n labeled nodes with n edges where each maximally connected subgraph has at most one cycle.
|
|
2
|
|
|
|
1, 1, 15, 455, 20475, 1220499, 90612753, 8055867105, 834505143615, 98716154311775, 13130233759131489, 1939826433518297961, 315169336802124178465, 55852728904993187133225, 10721612205253023622081875, 2216303140328629150998750435, 490841301461498403844464646155
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
All terms are odd.
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
