Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104305
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104305 Largest possible difference between consecutive marks that can occur amongst all possible perfect rulers of length n. +0
3
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, 15, 15, 16, 14, 15, 7, 18, 18, 19, 17, 18, 16, 7, 21, 22, 22, 21, 20, 21, 20, 25, 25, 25, 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 (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 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.

CROSSREFS

Cf. A104306 corresponding occurrence counts.

Adjacent sequences: A104302 A104303 A104304 this_sequence A104306 A104307 A104308

Sequence in context: A088462 A093337 A120397 this_sequence A050506 A029122 A134482

KEYWORD

nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Feb 28 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research