login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212661 a(n) = smallest number of edges that must be removed from K_n to obtain a graceful graph. 3
0, 0, 1, 2, 4, 5, 7, 9, 12, 16, 20, 23, 26, 30, 35, 41, 48, 52, 57, 63, 70, 78, 87 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,4

REFERENCES

G. S. Bloom and S. W. Golomb, Applications of numbered undirected graphs. Proc. IEEE 65 (1977), 562-570.

G. S. Bloom and S. W. Golomb, Numbered complete graphs, unusual rulers, and assorted applications. Theory and Applications of Graphs, Lecture Notes in Math. 642, (1978), 53-65.

Miller, J. C. P. Difference bases. Three problems in additive number theory. Computers in number theory (Proc. Sci. Res. Council Atlas Sympos. No. 2, Oxford, 1969), pp. 299--322. Academic Press, London,1971. MR0316269 (47 #4817) - From N. J. A. Sloane, Jun 05 2012

Rhys Price Jones, Gracelessness, Proc. 10th S.-E. Conf. Combin., Graph Theory and Computing, 1979, pp. 547-552. - From N. J. A. Sloane, Jun 05 2012

LINKS

Table of n, a(n) for n=3..25.

Index entries for sequences related to Golomb rulers

FORMULA

n(n-1)/2 = a(n)+A004137(n). - Kellen Myers, Jun 06 2016

CROSSREFS

Cf. A003022, A078106, A004137.

Sequence in context: A056833 A275534 A069355 * A288511 A249058 A105771

Adjacent sequences:  A212658 A212659 A212660 * A212662 A212663 A212664

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Jun 05 2012

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 22:21 EDT 2018. Contains 316252 sequences. (Running on oeis4.)