A106683 -id:A106683 - cp's OEIS frontend

A003022 Length of shortest (or optimal) Golomb ruler with n marks.

1, 3, 6, 11, 17, 25, 34, 44, 55, 72, 85, 106, 127, 151, 177, 199, 216, 246, 283, 333, 356, 372, 425, 480, 492, 553, 585

Offset: 2

a(n) is the least integer such that there is an n-element set of integers between 0 and a(n), the sums of pairs (of not necessarily distinct elements) of which are distinct.
From David W. Wilson, Aug 17 2007: (Start)
An n-mark Golomb ruler has a unique integer distance between any pair of marks and thus measures n(n-1)/2 distinct integer distances.
An optimal n-mark Golomb ruler has the smallest possible length (distance between the two end marks) for an n-mark ruler.
A perfect n-mark Golomb ruler has length exactly n(n-1)/2 and measures each distance from 1 to n(n-1)/2. (End)
Positions where A143824 increases (see also A227590). - N. J. A. Sloane, Apr 08 2016
From Gus Wiseman, May 17 2019: (Start)
Also the smallest m such that there exists a length-n composition of m for which every restriction to a subinterval has a different sum. Representatives of compositions for the first few terms are:
   0: ()
   1: (1)
   3: (2,1)
   6: (2,3,1)
  11: (3,1,5,2)
  17: (4,2,3,7,1)
Representatives of corresponding Golomb rulers are:
  {0}
  {0,1}
  {0,2,3}
  {0,2,5,6}
  {0,3,4,9,11}
  {0,4,6,9,16,17}
(End)

			a(5)=11 because 0-1-4-9-11 (0-2-7-10-11) resp. 0-3-4-9-11 (0-2-7-8-11) are shortest: there is no b0-b1-b2-b3-b4 with different distances |bi-bj| and max. |bi-bj| < 11.

CRC Handbook of Combinatorial Designs, 1996, p. 315.
A. K. Dewdney, Computer Recreations, Scientific Amer. 253 (No. 6, Jun), 1985, pp. 16ff; 254 (No. 3, March), 1986, pp. 20ff.
S. W. Golomb, How to number a graph, pp. 23-37 of R. C. Read, editor, Graph Theory and Computing. Academic Press, NY, 1972.
Richard K. Guy, Unsolved Problems in Number Theory (2nd edition), Springer-Verlag (1994), Section C10.
A. Kotzig and P. J. Laufer, Sum triangles of natural numbers having minimum top, Ars. Combin. 21 (1986), 5-13.
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)
Rhys Price Jones, Gracelessness, Proc. 10th S.-E. Conf. Combin., Graph Theory and Computing, 1979, pp. 547-552.
Ana Salagean, David Gardner and Raphael Phan, Index Tables of Finite Fields and Modular Golomb Rulers, in Sequences and Their Applications - SETA 2012, Lecture Notes in Computer Science. Volume 7280, 2012, pp. 136-147.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Anonymous, In Search Of The Optimal 20, 21 and 22 Mark Golomb Rulers
Thomas Bloom, Problem 30, Problem 43, Problem 155, and Problem 861, Erdős Problems.
A. K. Dewdney, Computer Recreations, Scientific Amer. 253 (No. 6, Jun), 1985, pp. 16ff; 254 (No. 3, March), 1986, pp. 20ff. [Annotated scanned copy]
Distributed.Net, Project OGR
Kent Freeman, Unpublished notes. [Scanned copy]
Michael Geißer, Theresa Körner, Sascha Kurz, and Anne Zahn, Squares with three digits, arXiv:2112.00444 [math.NT], 2021.
S. W. Golomb, Letter to N. J. A. Sloane, 1972.
A. Kotzig and P. J. Laufer, Sum triangles of natural numbers having minimum top, Ars. Combin. 21 (1986), 5-13. [Annotated scanned copy]
Joseph Malkevitch, Weird Rulers.
Greg Martin and Kevin O'Bryant, Constructions of generalized Sidon sets, arXiv:math/0408081 [math.NT], 2004-2005.
Lloyd Miller, Golomb Rulers
Kevin O'Bryant, Sets of Natural Numbers with Proscribed Subsets, J. Int. Seq. 18 (2015) # 15.7.7
Ed Pegg, Jr., Math Games: Rulers, Arrays, and Gracefulness
Bill Rankin, Golomb Ruler Calculations
Walter Schneider, Golomb Rulers
James B. Shearer, Golomb ruler table
James B. Shearer, Table of Known Optimal Golomb Rulers
James B. Shearer, Difference Triangle Sets: Known optimal solutions.
James B. Shearer, Difference Triangle Sets: Discoverers
David Singmaster, David Fielker, and N. J. A. Sloane, Correspondence, August 1979
N. J. A. Sloane, First few optimal Golomb rulers
Terence Tao, Erdős problem database, see nos. 30, 43, 155, 861.
D. Vanderschel et al., In Search Of The Optimal 20, 21 and 22 Mark Golomb Rulers
Eric Weisstein's World of Mathematics, Golomb Ruler.
Wikipedia, Golomb ruler
Index entries for sequences related to Golomb rulers

See A106683 for triangle of marks.
Cf. A008404, A036501, A039953, A078106, A030873.
0-1-4-9-11 corresponds to 1-3-5-2 in A039953: 0+1+3+5+2=11
A row or column of array in A234943.
Adding 1 to these terms gives A227590. Cf. A143824.
For first differences see A270813.
Cf. A103295, A108917, A143823, A169942.
Cf. A325466, A325545, A325676, A325677, A325678, A325683.

Min@@Total/@#&/@GatherBy[Select[Join@@Permutations/@Join@@Table[IntegerPartitions[i],{i,0,15}],UnsameQ@@ReplaceList[#,{_,s__,_}:>Plus[s]]&],Length] (* Gus Wiseman, May 17 2019 *)

from itertools import combinations, combinations_with_replacement, count
def a(n):
    for k in count(n-1):
        for c in combinations(range(k), n-1):
            c = c + (k, )
            ss = set()
            for s in combinations_with_replacement(c, 2):
                if sum(s) in ss: break
                else: ss.add(sum(s))
            if len(ss) == n*(n+1)//2: return k # Jianing Song, Feb 14 2025, adapted from the python program of A345731

a(n) >= n(n-1)/2, with strict inequality for n >= 5 (Golomb). - David W. Wilson, Aug 18 2007

425 sent by Ed Pegg Jr, Nov 15 2004
a(25), a(26) proved by OGR-25 and OGR-26 projects, added by Max Alekseyev, Sep 29 2010
a(27) proved by OGR-27, added by David Consiglio, Jr., Jun 09 2014
a(28) proved by OGR-28, added by David Consiglio, Jr., Jan 19 2023

A039953 Triangle of "canonical" optimal Golomb rulers.

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 1, 3, 5, 2, 1, 3, 6, 2, 5, 1, 3, 6, 8, 5, 2, 1, 3, 5, 6, 7, 10, 2, 1, 4, 7, 13, 2, 8, 6, 3, 1, 5, 4, 13, 3, 8, 7, 12, 2, 1, 3, 9, 15, 5, 14, 7, 10, 6, 2, 2, 4, 18, 5, 11, 3, 12, 13, 7, 1, 9, 2, 3, 20, 12, 6, 16, 11, 15, 4, 9, 1, 7

Offset: 1

N. J. A. Sloane

n-th row gives first differences of the (n+1)-th row of A106683. - Andrey Zabolotskiy, Aug 22 2017

			Triangle begins:
  1;
  1, 2;
  1, 3, 2;
  1, 3, 5, 2;
  1, 3, 6, 2, 5;
  1, 3, 6, 8, 5, 2;
  ...

CRC Handbook of Combinatorial Designs, 1996, p. 315.
A. Kotzig and P. J. Laufer, Sum triangles of natural numbers having minimum top, Ars. Combin. 21 (1986), 5-13.

Distributed.Net, Project OGR
L. Miller, Golomb Rulers
B. Rankin, Golomb Ruler Calculations
J. B. Shearer, Golomb ruler table
N. J. A. Sloane, First few optimal Golomb rulers
Eric Weisstein's World of Mathematics, Golomb Ruler
Wikipedia, Golomb ruler
Index entries for sequences related to Golomb rulers

Cf. A003022, A036501.

These all start at 1. For rulers starting at 0, see A079283, A079287, A079423, A079425, A079426, A079430, A079433, A079434, A079435, A079454 and A079467, A079604, A079605, A079606, A079607, A079608, A079625, A079634.

Corrected by Philip Newton, Feb 06 2002

Corrected by Andrey Zabolotskiy, Aug 22 2017

A078106 a(n) = A003022(n) - A000217(n-1).

Original entry on oeis.org

0, 0, 0, 1, 2, 4, 6, 8, 10, 17, 19, 28, 36, 46, 57, 63, 63, 75, 93, 123, 125, 119, 149, 180, 167, 202, 207

Offset: 2

Michael Gilleland, Nov 24 2002

nonn

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).

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

Index entries for sequences related to Golomb rulers

Cf. A000217, A003022, A106683.

a(n) = A003022(n) - A000217(n-1).

Made consistent with A003022 by Peter Munn, Jul 23 2019

a(24)-a(28) computed using A003022 by Floris P. van Doorn, Mar 06 2023

cp's OEIS Frontend

A003022 Length of shortest (or optimal) Golomb ruler with n marks.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A039953 Triangle of "canonical" optimal Golomb rulers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A078106 a(n) = A003022(n) - A000217(n-1).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

Extensions

A347499 Triangle read by rows: n-th row is the lexicographically earliest n-element subset of {1,2,3,...,A347498(n)} with the property that all products i * j are distinct for i <= j.

Views

Author

Keywords

Comments

Examples

Crossrefs

A106676 Marks on 9-mark optimal Golomb ruler.

Views

Author

Keywords

Comments

Links

Crossrefs