|
Search: id:A103296
|
|
|
| A103296 |
|
Number of complete rulers with n segments. |
|
+0
5
|
| |
|
|
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) = Sum(T(i, n), i from n to A004137(n+1)) where T is the triangle described by A103294.
|
|
EXAMPLE
|
a(2)=3 counts the complete rulers with 2 segments, {[0,1,2],[0,1,3],[0,2,3]}.
|
|
PROGRAM
|
Link to FORTRAN program given in A103295.
|
|
CROSSREFS
|
Cf. A103301 (Perfect rulers with n segments), A103299 (Optimal rulers with n segments).
Cf. A103295 (complete rulers of length n).
Sequence in context: A074527 A010842 A140710 this_sequence A111749 A007163 A050385
Adjacent sequences: A103293 A103294 A103295 this_sequence A103297 A103298 A103299
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Peter Luschny (peter(AT)luschny.de) Feb 28 2005
|
|
EXTENSIONS
|
a(9) from Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 17 2005
|
|
|
Search completed in 0.002 seconds
|
