A104308 Number of perfect rulers of length n having the least possible largest difference between any adjacent marks that can occur amongst all perfect rulers of this length.

1, 1, 1, 2, 1, 1, 1, 2, 1, 7, 3, 1, 1, 3, 1, 3, 1, 1, 12, 3, 1, 1, 1, 4, 1, 6, 1, 1, 1, 22, 7, 1, 3, 1, 1, 1, 1, 15, 3, 1, 1, 1, 1, 14, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 2, 1, 13, 3, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 7, 3, 10, 4, 2, 3, 1, 1, 7, 3, 26, 10, 10, 2, 1, 3, 1, 1, 1, 26, 10, 26, 2, 4, 8, 3, 1, 1, 1

Offset

1,4

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

a(11)=3 because 3 of the A103300(11)/2=15 perfect rulers of length 11 can be constructed using the shortest possible maximum segment length A104307(11)=3: [0,1,2,5,8,11], [0,1,4,6,9,11], [0,1,4,7,9,11], not counting their mirror images.

Crossrefs

Cf. A104307 size of minimally required longest segment, A103294 definitions related to complete rulers.

Sequence in context: A323409 A080388 A330742 * A175456 A122377 A293900

Adjacent sequences: A104305 A104306 A104307 * A104309 A104310 A104311

Keyword

nonn

Author

Hugo Pfoertner, Mar 01 2005

Status

approved