|
|
A325304
|
|
Irregular triangle read by rows: T(n,k) is the number of connected graphs on n unlabeled nodes with matching number k, (0 <= k <= floor(n/2)).
|
|
2
|
|
|
1, 1, 0, 1, 0, 2, 0, 1, 5, 0, 1, 20, 0, 1, 16, 95, 0, 1, 22, 830, 0, 1, 29, 790, 10297, 0, 1, 37, 1479, 259563, 0, 1, 46, 2625, 166988, 11546911
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1;
1;
0, 1;
0, 2;
0, 1, 5;
0, 1, 20;
0, 1, 16, 95;
0, 1, 22, 830;
0, 1, 29, 790, 10297;
0, 1, 37, 1479, 259563;
0, 1, 46, 2625, 166988, 11546911;
...
|
|
CROSSREFS
|
Cf. A286951 (not necessarily connected).
Cf. A218463 (right diagonal, even terms).
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|