OFFSET
0,6
COMMENTS
The colors may be interchanged.
REFERENCES
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
LINKS
R. W. Robinson, Rows 0 through 7, flattened
F. Harary, L. March and R. W. Robinson, On enumerating certain design problems in terms of bicolored graphs with no isolates, Environment and Planning, B 5 (1978), 31-43.
F. Harary, L. March and R. W. Robinson, On enumerating certain design problems in terms of bicolored graphs with no isolates, Environment and Planning B: Urban Analytics and City Science, 5 (1978), 31-43. [Annotated scanned copy]
EXAMPLE
n = 0
k = 0 : 1, 1
Total = 1, 1
n = 1
k = 0 : 1, 0
k = 1 : 1, 1
Total = 2, 1
n = 2
k = 0 : 1, 0
k = 1 : 1, 0
k = 2 : 2, 1
k = 3 : 1, 1
k = 4 : 1, 1
Totals = 6, 3
n = 3
k = 0 : 1, 0
k = 1 : 1, 0
k = 2 : 2, 0
k = 3 : 4, 1
k = 4 : 5, 2
k = 5 : 5, 4
k = 6 : 4, 3
k = 7 : 2, 2
k = 8 : 1, 1
k = 9 : 1, 1
Totals = 26, 14
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
N. J. A. Sloane, Nov 14 2006
STATUS
approved