|
Search: id:A103295
|
|
|
| A103295 |
|
Number of complete rulers with length n. |
|
+0
3
|
|
| 1, 1, 1, 3, 4, 9, 17, 33, 63, 128, 248, 495, 988, 1969, 3911, 7857, 15635, 31304, 62732, 125501, 250793, 503203, 1006339, 2014992, 4035985, 8080448, 16169267, 32397761, 64826967, 129774838, 259822143, 520063531, 1040616486, 2083345793, 4168640894, 8342197304, 16694070805
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
For definitions, references and links related to complete rulers see A103294.
|
|
LINKS
|
Index entries for sequences related to perfect rulers.
Hugo Pfoertner, Count complete rulers of given length. FORTRAN program.
|
|
FORMULA
|
a(n) = Sum(T(n, i), i from 0 to n) = Sum(T(n, i), i from A103298(n) to n), T = A103294
|
|
EXAMPLE
|
a(4)=4 counts the complete rulers with length 4, {[0,2,3,4],[0,1,3,4],[0,1,2,4],[0,1,2,3,4]}.
|
|
CROSSREFS
|
Cf. A103300 (Perfect rulers with length n).
Sequence in context: A093368 A095095 A003611 this_sequence A028344 A078010 A110810
Adjacent sequences: A103292 A103293 A103294 this_sequence A103296 A103297 A103298
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Peter Luschny (peter(AT)luschny.de) Feb 28 2005
|
|
EXTENSIONS
|
a(30)-a(36) from Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 17 2005
|
|
|
Search completed in 0.002 seconds
|
