login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103294 Triangle T, read by rows: T(n,k) = number of complete rulers with length n and k segments (n>=0,k>=0). 15
1, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 0, 0, 3, 1, 0, 0, 0, 4, 4, 1, 0, 0, 0, 2, 9, 5, 1, 0, 0, 0, 0, 12, 14, 16, 1, 0, 0, 0, 0, 8, 27, 20, 7, 1, 0, 0, 0, 0, 4, 40, 48, 27, 8, 1, 0, 0, 0, 0, 0, 38, 90, 75, 35, 9, 1, 0, 0, 0, 0, 0, 30, 134, 166, 110, 44, 10, 1, 0, 0, 0, 0, 0, 14, 166, 311, 277 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

If n=k then T(n,k)=1.

A ruler is a strict increasing finite sequence of marks (nonnegative integers).

A segment of a ruler is the space between two adjacent marks. The number of segments is the number of marks - 1.

A ruler is complete if the set of all distances it can measure is {1,2,3,...,k} for some integer k>=1.

A ruler is perfect if it is complete and no complete ruler with the same length possesses less marks.

A ruler is optimal if it is perfect and no perfect ruler with the same number of segments has a greater length.

The 'empty ruler' with length n=0 is considered perfect and optimal.

REFERENCES

R. K. Guy, Modular difference sets and error correcting codes. in: Unsolved Problems in Number Theory, 3rd ed. New York: Springer-Verlag, chapter C10, pp. 181-183, 2004.

J. C. P. Miller, Difference bases: Three problems in additive number theory, pp. 299-322 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.

B. Wichmann. A note on restricted difference bases. J. London Math.Soc. 38, 1962, 465-466

LINKS

Table of n, a(n) for n=0..86.

Peter Luschny, Perfect and Optimal Rulers.

Peter Luschny, Table of Counts.

Eric Weisstein's World of Mathematics, Perfect Ruler.

Index entries for sequences related to perfect rulers.

EXAMPLE

Rows begin:

[1],

[0,1],

[0,0,1],

[0,0,2,1],

[0,0,0,3,1],

[0,0,0,4,4,1],

[0,0,0,2,9,5,1],

[0,0,0,0,12,14,6,1],

[0,0,0,0,8,27,20,7,1],...

a(19)=T(5,4)=4 counts the complete rulers with length 5 and 4 segments: {[0,2,3,4,5],[0,1,3,4,5],[0,1,2,4,5],[0,1,2,3,5]}

CROSSREFS

Row sums give A103295. Column sums give A103296. The first nonzero entries in the rows give A103300.

The last nonzero entries in the columns give A103299. The row numbers of the last nonzero entries in the columns give A004137.

Cf. A103295 through A103301, A004137.

Sequence in context: A064287 A196389 A128206 * A198379 A079680 A037855

Adjacent sequences:  A103291 A103292 A103293 * A103295 A103296 A103297

KEYWORD

nonn,tabl

AUTHOR

Peter Luschny Feb 28 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 15:24 EST 2016. Contains 278770 sequences.