%N Number of distances not measured by the shortest Golomb ruler with n marks (i.e., length of shortest Golomb ruler with n marks minus number of distances measured by that ruler.
%C Appears to be (length of shortest Golomb ruler with n marks) - n*(n-1)/2; or A003022(n) - A000217(n-1).
%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>
%Y Cf. A000217, A003022, A106683.
%A Michael Gilleland, Nov 24 2002
%E Made consistent with A003022 by _Peter Munn_, Jul 23 2019