This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104305 Largest possible difference between consecutive marks that can occur amongst all possible perfect rulers of length n. 2

%I

%S 1,1,2,2,3,3,4,4,4,5,5,6,6,7,7,8,7,9,9,10,10,9,9,12,12,12,13,11,12,14,

%T 15,15,16,14,15,7,18,18,19,17,18,16,7,21,22,22,21,20,21,20,25,25,25,

%U 26,25,24,25,24,28,29,29,30,29,28,29,28,11,11,33,34,33,33,34,32,31,9,10,11

%N Largest possible difference between consecutive marks that can occur amongst all possible perfect rulers of length n.

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

%H Peter Luschny, <a href="http://www.luschny.de/math/rulers/introe.html">Perfect and Optimal Rulers.</a> A short introduction.

%H 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 <a href="/index/Per#perul">Index entries for sequences related to perfect rulers.</a>

%e There are 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 maximum difference between adjacent marks occurs for the second ruler between marks "5" and "11". Therefore a(13)=6.

%Y Cf. A104306 corresponding occurrence counts.

%K nonn

%O 1,3

%A _Hugo Pfoertner_, Feb 28 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 18 01:55 EST 2019. Contains 320237 sequences. (Running on oeis4.)