login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

REFERENCES

S. Brandt et al., Edge-injective and edge-surjective vertex labelings, SIAM J. Discrete Math., 24 (2010), 666-683.

LINKS

Table of n, a(n) for n=2..29.

CROSSREFS

Sequence in context: A238482 A033100 A030741 * A304632 A306385 A039853

Adjacent sequences:  A190266 A190267 A190268 * A190270 A190271 A190272

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 06 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 4 06:59 EDT 2020. Contains 333213 sequences. (Running on oeis4.)