|
|
A008327
|
|
Triangle read by rows: T(n,k) is the number of simple regular bipartite graphs with 2n nodes and degree k, (0 <= k <= n).
|
|
9
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 6, 4, 1, 1, 1, 1, 4, 14, 14, 4, 1, 1, 1, 1, 7, 41, 130, 41, 7, 1, 1, 1, 1, 8, 157, 1981, 1981, 157, 8, 1, 1, 1, 1, 12, 725, 62616, 304496, 62616, 725, 12, 1, 1, 1, 1, 14, 4196, 2806508, 78322916
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,13
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1,
1, 1,
1, 1, 1,
1, 1, 1, 1,
1, 1, 2, 1, 1,
1, 1, 2, 2, 1, 1,
1, 1, 4, 6, 4, 1, 1;
1, 1, 4, 14, 14, 4, 1, 1;
1, 1, 7, 41, 130, 41, 7, 1, 1;
1, 1, 8, 157, 1981, 1981, 157, 8, 1, 1;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Eric Rogoyski, May 15 1997
|
|
STATUS
|
approved
|
|
|
|