Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Mar 07 2023 10:35:36
%S 0,0,0,1,2,4,6,8,10,17,19,28,36,46,57,63,63,75,93,123,125,119,149,180,
%T 167,202,207
%N a(n) = A003022(n) - A000217(n-1).
%C Previous name was: 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).
%D J. C. P Miller, 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 a(n) = A003022(n) - A000217(n-1).
%Y Cf. A000217, A003022, A106683.
%K nonn
%O 2,5
%A Michael Gilleland, Nov 24 2002
%E Made consistent with A003022 by _Peter Munn_, Jul 23 2019
%E a(24)-a(28) computed using A003022 by _Floris P. van Doorn_, Mar 06 2023