|
| |
|
|
A007183
|
|
Maximal splittance of graph with n nodes.
(Formerly M0550)
|
|
0
| |
|
|
0, 0, 0, 1, 2, 3, 4, 6, 8, 10, 12, 15, 16, 19, 22, 25, 27, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
REFERENCES
| P. L. Hammer and B. Simeone, The splittance of a graph, Combinatorica, 1 (1981), 275-284.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
CROSSREFS
| Sequence in context: A078769 A064375 A037229 * A067783 A062418 A056168
Adjacent sequences: A007180 A007181 A007182 * A007184 A007185 A007186
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
