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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

%I

%S 0,0,1,2,4,5,7,9,12,16,20,23,26,30,35,41,48,52,57,63,70,78,87

%N a(n) = smallest number of edges that must be removed from K_n to obtain a graceful graph.

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

%D 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.

%D 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

%D 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

%H <a href="/index/Go#Golomb">Index entries for sequences related to Golomb rulers</a>

%F n(n-1)/2 = a(n)+A004137(n). - _Kellen Myers_, Jun 06 2016

%Y Cf. A003022, A078106, A004137.

%K nonn,more

%O 3,4

%A _N. J. A. Sloane_, Jun 05 2012

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 January 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)