A104307 Least maximum of differences between consecutive marks that can occur amongst all possible perfect rulers of length n.

1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 3, 4, 4, 4, 5, 6, 4, 4, 5, 5, 6, 6, 5, 5, 5, 6, 6, 6, 7, 5, 6, 6, 6, 6, 7, 7, 6, 6, 6, 6, 7, 7, 7, 6, 6, 6, 7, 7, 7, 7, 9, 6, 7, 7, 7, 7, 7, 8, 11, 9, 10, 7, 7, 7, 8, 8, 9, 10, 9, 10, 10, 11, 8, 8, 9, 9, 10, 9, 11, 10, 10, 11, 11, 9, 9, 10, 9, 10, 11, 10

Offset

1,3

Comments

For nomenclature related to perfect and optimal rulers see Peter Luschny's "Perfect Rulers" web pages.

Links

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, Table of n, a(n) for n = 1..208 [a(212), a(213) commented out by Georg Fischer, Mar 25 2022]

Peter Luschny, Perfect and Optimal Rulers. A short introduction.

Hugo Pfoertner, Largest and smallest maximum differences of consecutive marks of perfect rulers.

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, MRLA search results and source code, Nov 6 2020.

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, Large Minimum Redundancy Linear Arrays: Systematic Search of Perfect and Optimal Rulers Exploiting Parallel Processing, IEEE Open Journal of Antennas and Propagation, 2 (2021), 79-85.

Index entries for sequences related to perfect rulers.

Example

There are A103300(13)=6 perfect rulers of length 13: [0,1,2,6,10,13], [0,1,4,5,11,13], [0,1,6,9,11,13] and their mirror images. The first ruler produces the least maximum difference 4=6-2=10-6 between any of its adjacent marks. Therefore a(13)=4.

Crossrefs

Cf. A104308 corresponding occurrence counts, A104310 position of latest occurrence of n as a sequence term, A103294 definitions related to complete rulers.

Sequence in context: A079085 A076869 A335925 * A264029 A263873 A263799

Adjacent sequences: A104304 A104305 A104306 * A104308 A104309 A104310

Keyword

nonn

Author

Hugo Pfoertner, Mar 01 2005

Status

approved