|
| |
|
|
A123461
|
|
Number of strongly perfect perfect graphs on n nodes.
|
|
0
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Table of n, a(n) for n=1..10.
S. Hougardy, Home Page
S. Hougardy, Classes of perfect graphs, Discr. Math. 306 (2006), 2529-2571.
Lawrence Ong, Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers, arXiv preprint arXiv:1606.05982 [cs.IT], 2016.
|
|
|
CROSSREFS
|
Sequence in context: A123457 A123455 A123447 * A123407 A123446 A123460
Adjacent sequences: A123458 A123459 A123460 * A123462 A123463 A123464
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
N. J. A. Sloane, Oct 18 2006
|
|
|
STATUS
|
approved
|
| |
|
|
