A103296 Number of complete rulers with n segments.

1, 1, 3, 10, 38, 175, 885, 5101, 32080, 219569, 1616882, 12747354, 106948772, 950494868

Offset: 0

Author

Peter Luschny, Feb 28 2005

Keywords

• nonn
• hard
• more

Comments

For definitions, references and links related to complete rulers see A103294.

a(10) > 1616740 (contributions from rows of A103294 up to 39). - Hugo Pfoertner, Dec 16 2021

Examples

			a(2)=3 counts the complete rulers with 2 segments, {[0,1,2],[0,1,3],[0,2,3]}.
		

Links

• Index entries for sequences related to perfect rulers.

Crossrefs

Cf. A103301 (perfect rulers with n segments), A103299 (optimal rulers with n segments).

Cf. A103294, A103295 (complete rulers of length n).

Programs

Fortran

! Link to FORTRAN program given in A103295.

Formula

a(n) = Sum_{i=n..A004137(n+1)} T(i, n) where T is the A103294 triangle.

Extensions

a(9) from Hugo Pfoertner, Mar 17 2005

a(10)-a(11) from Fausto A. C. Cariboni, Mar 03 2022

a(12)-a(13) from Fausto A. C. Cariboni, Mar 08 2022