|
| |
|
|
A103296
|
|
Number of complete rulers with n segments.
|
|
4
| | |
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| 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]}.
|
|
|
PROG
| 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: A186367 A010842 A140710 * A111749 A149048 A149049
Adjacent sequences: A103293 A103294 A103295 * 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
|
| |
|
|
