%I A104307
%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,6,
%T A104307 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,
%U A104307 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 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 <a href="Sindx_Per.html#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.
%Y A104307 Sequence in context: A076984 A079085 A076869 this_sequence A128330 A133801 
               A112310
%Y A104307 Adjacent sequences: A104304 A104305 A104306 this_sequence A104308 A104309 
               A104310
%K A104307 nonn
%O A104307 1,3
%A A104307 Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 01 2005