Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103297
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103297 Number of different lengths that perfect rulers with n segments can have. +0
4
1, 1, 2, 3, 3, 4, 4, 6, 6, 7, 7, 7, 8, 10, 11, 11, 11, 11, 11, 15 (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) = A004137(n+1) - A004137(n) for n>= 1.

EXAMPLE

a(5)=4 because a perfect ruler with 5 segments may have the length 10, 11, 12 or 13.

CROSSREFS

Cf. A103298.

Adjacent sequences: A103294 A103295 A103296 this_sequence A103298 A103299 A103300

Sequence in context: A130120 A127434 A105677 this_sequence A095916 A130121 A007898

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 October 16 00:31 EDT 2008. Contains 145098 sequences.


AT&T Labs Research