This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104307 Least maximum of differences between consecutive marks that can occur amongst all possible perfect rulers of length n. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS For nomenclature related to perfect and optimal rulers see Peter Luschny's "Perfect Rulers" web pages. LINKS Peter Luschny, Perfect and Optimal Rulers. A short introduction. 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: A076984 A079085 A076869 * A264029 A263873 A263799 Adjacent sequences:  A104304 A104305 A104306 * A104308 A104309 A104310 KEYWORD nonn AUTHOR Hugo Pfoertner, Mar 01 2005 STATUS approved

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 March 25 03:50 EDT 2019. Contains 321450 sequences. (Running on oeis4.)