cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A104307 #14 Mar 25 2022 09:28:12
%S A104307 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,
%T A104307 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,
%U A104307 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
%N A104307 Least maximum of differences between consecutive marks that can occur amongst all possible perfect rulers of length n.
%C A104307 For nomenclature related to perfect and optimal rulers see Peter Luschny's "Perfect Rulers" web pages.
%H A104307 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="/A104307/b104307.txt">Table of n, a(n) for n = 1..208</a> [a(212), a(213) commented out by _Georg Fischer_, Mar 25 2022]
%H A104307 Peter Luschny, <a href="http://www.luschny.de/math/rulers/introe.html">Perfect and Optimal Rulers.</a> A short introduction.
%H A104307 Hugo Pfoertner, <a href="http://www.randomwalk.de/scimath/diffset/consdifs.txt">Largest and smallest maximum differences of consecutive marks of perfect rulers.</a>
%H A104307 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="https://dx.doi.org/10.21227/cd4b-nb07">MRLA search results and source code</a>, Nov 6 2020.
%H A104307 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="https://doi.org/10.1109/OJAP.2020.3043541">Large Minimum Redundancy Linear Arrays: Systematic Search of Perfect and Optimal Rulers Exploiting Parallel Processing</a>, IEEE Open Journal of Antennas and Propagation, 2 (2021), 79-85.
%H A104307 <a href="/index/Per#perul">Index entries for sequences related to perfect rulers.</a>
%e A104307 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.
%Y A104307 Cf. A104308 corresponding occurrence counts, A104310 position of latest occurrence of n as a sequence term, A103294 definitions related to complete rulers.
%K A104307 nonn
%O A104307 1,3
%A A104307 _Hugo Pfoertner_, Mar 01 2005