|
Search: id:A104307
|
|
|
| A104307 |
|
Least maximum of differences between consecutive marks that can occur amongst all possible perfect rulers of length n. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
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.
Hugo Pfoertner, Largest and smallest maximum differences of consecutive marks of perfect rulers.
Index entries for sequences related to perfect rulers.
|
|
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 this_sequence A128330 A133801 A112310
Adjacent sequences: A104304 A104305 A104306 this_sequence A104308 A104309 A104310
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 01 2005
|
|
|
Search completed in 0.005 seconds
|
