login
A190269
a(n) = maximal k for which the complete graph on n nodes allows an edge-surjective vertex-k-labeling.
0
1, 1, 2, 3, 4, 5, 7, 9, 12, 15, 18, 21, 25, 29, 33, 37, 42, 47, 52, 57, 63, 69, 76, 83, 90, 97, 106, 115
OFFSET
2,3
REFERENCES
S. Brandt et al., Edge-injective and edge-surjective vertex labelings, SIAM J. Discrete Math., 24 (2010), 666-683.
CROSSREFS
Sequence in context: A368483 A033100 A030741 * A304632 A306385 A039853
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 06 2011
STATUS
approved