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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103299 Number of optimal rulers with n segments (n>=0). 4
1, 1, 2, 2, 4, 6, 12, 4, 6, 2, 2, 4, 12, 4, 2, 2, 2, 2, 4, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

For definitions, references and links related to complete rulers see A103294.

LINKS

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

Index entries for sequences related to perfect rulers.

FORMULA

a(n) = A103300(A004137(n+1))

EXAMPLE

a(5)=6 counts the optimal rulers with 5 segments, {[0,1,6,9,11,13], [0,2,4,7,12,13], [0,1,4,5,11,13], [0,2,8,9,12,13], [0,1,2,6,10,13], [0,3,7,11,12,13]}.

CROSSREFS

Cf. A103296 (Complete rulers with n segments), A103301 (Perfect rulers with n segments).

Sequence in context: A000672 A129860 A115868 * A278246 A195204 A228892

Adjacent sequences:  A103296 A103297 A103298 * A103300 A103301 A103302

KEYWORD

nonn,hard,more

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 September 22 00:25 EDT 2017. Contains 292326 sequences.