

A078106


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.


2



0, 0, 0, 1, 2, 4, 6, 8, 10, 17, 19, 28, 36, 46, 57, 63, 63, 75, 93, 123, 125, 119
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Appears to be (length of shortest Golomb ruler with n marks)  n*(n+1)/2; or A003022  A000217.


REFERENCES

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. 299322. 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. 547552.  From N. J. A. Sloane, Jun 05 2012


LINKS

Table of n, a(n) for n=1..22.
Index entries for sequences related to Golomb rulers


CROSSREFS

Sequence in context: A175299 A088008 A067720 * A111082 A100433 A254343
Adjacent sequences: A078103 A078104 A078105 * A078107 A078108 A078109


KEYWORD

nonn


AUTHOR

Michael Gilleland, Nov 24 2002


STATUS

approved



