This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103295 Number of complete rulers with length n. 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; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS For definitions, references and links related to complete rulers see A103294. LINKS 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: A095095 A003611 A192115 * A217492 A178784 A192288 Adjacent sequences:  A103292 A103293 A103294 * A103296 A103297 A103298 KEYWORD nonn AUTHOR Peter Luschny Feb 28 2005 EXTENSIONS a(30)-a(36) from Hugo Pfoertner, Mar 17 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.