This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A103296 #31 Oct 05 2024 21:05:21
%S A103296 1,1,3,10,38,175,885,5101,32080,219569,1616882,12747354,106948772,
%T A103296 950494868
%N A103296 Number of complete rulers with n segments.
%C A103296 For definitions, references and links related to complete rulers see A103294.
%C A103296 a(10) > 1616740 (contributions from rows of A103294 up to 39). - _Hugo Pfoertner_, Dec 16 2021
%H A103296 <a href="/index/Per#perul">Index entries for sequences related to perfect rulers.</a>
%F A103296 a(n) = Sum_{i=n..A004137(n+1)} T(i, n) where T is the A103294 triangle.
%e A103296 a(2)=3 counts the complete rulers with 2 segments, {[0,1,2],[0,1,3],[0,2,3]}.
%o A103296 (Fortran) ! Link to FORTRAN program given in A103295.
%Y A103296 Cf. A103301 (perfect rulers with n segments), A103299 (optimal rulers with n segments).
%Y A103296 Cf. A103294, A103295 (complete rulers of length n).
%K A103296 nonn,hard,more
%O A103296 0,3
%A A103296 _Peter Luschny_, Feb 28 2005
%E A103296 a(9) from _Hugo Pfoertner_, Mar 17 2005
%E A103296 a(10)-a(11) from _Fausto A. C. Cariboni_, Mar 03 2022
%E A103296 a(12)-a(13) from _Fausto A. C. Cariboni_, Mar 08 2022