Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103299
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103299 Number of optimal rulers with n segments (n>=0). +0
5
1, 1, 2, 2, 4, 6, 12, 4, 6, 2, 2, 4, 12, 4, 2, 2, 2, 2, 4, 2 (list; graph; listen)
OFFSET

0,3

COMMENT

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

LINKS

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: A033961 A000672 A115868 this_sequence A154779 A010101 A129860

Adjacent sequences: A103296 A103297 A103298 this_sequence A103300 A103301 A103302

KEYWORD

nonn,hard

AUTHOR

Peter Luschny (peter(AT)luschny.de) 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research