|
Search: id:A123474
|
|
|
| A123474 |
|
Triangle read by rows: T(n,k) = number of labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class. The classes are interchangeable if k = n-k. Here n >= 2, k=1..n-1. |
|
+0
1
|
|
| 1, 0, 0, 0, 3, 0, 0, 10, 10, 0, 0, 15, 340, 15, 0, 0, 21, 6965, 6965, 21, 0, 0, 28, 51296, 246295, 51296, 28, 0, 0, 36, 326676, 14750946, 14750946, 326676, 36, 0, 0, 45, 1917840, 322476210, 796058676, 322476210, 1917840, 45, 0, 0, 55, 10683255
(list; table; graph; listen)
|
|
|
OFFSET
|
2,5
|
|
|
REFERENCES
|
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
|
|
LINKS
|
R. W. Robinson, Rows 2 through 25, flattened
|
|
EXAMPLE
|
Triangle begins:
1,
0,0,
0,3,0,
0,10,10,0,
0,15,340,15,0,
etc.
|
|
CROSSREFS
|
Adjacent sequences: A123471 A123472 A123473 this_sequence A123475 A123476 A123477
Sequence in context: A022001 A011073 A104751 this_sequence A105786 A101192 A037288
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
