banner
  Welcome Hints
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: A201542 A000672 A115868 * A195204 A228892 A154779

Adjacent sequences:  A103296 A103297 A103298 * A103300 A103301 A103302

KEYWORD

nonn, hard, more, changed

AUTHOR

Peter Luschny Feb 28 2005

STATUS

approved

Register | Login | Lookup | Browse | Recent | Index | Plot 2 | Demos | Music | Wiki
Superseeker | More pages | Editors | Help extend | Contribute sequence or comment

Content is available under The OEIS End-User License Agreement.
This site is supported by donations to The OEIS Foundation.
Last modified January 19 06:25 EST 2014. Contains 235762 sequences.