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 A103299 #18 Feb 24 2021 08:15:25
%S A103299 1,1,2,2,4,6,12,4,6,2,2,4,12,4,2,2,2,2,4,2,2,2,2,2,4
%N A103299 Number of optimal rulers with n segments (n>=0).
%C A103299 For definitions, references and links related to complete rulers see A103294.
%H A103299 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="https://dx.doi.org/10.21227/cd4b-nb07">MRLA search results and source code</a>, Nov 6 2020.
%H A103299 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="https://doi.org/10.1109/OJAP.2020.3043541">Large Minimum Redundancy Linear Arrays: Systematic Search of Perfect and Optimal Rulers Exploiting Parallel Processing</a>, IEEE Open Journal of Antennas and Propagation, 2 (2021), 79-85.
%H A103299 <a href="/index/Per#perul">Index entries for sequences related to perfect rulers.</a>
%F A103299 a(n) = A103300(A004137(n+1)).
%e A103299 a(5)=6 counts the optimal rulers with 5 segments, {[0,1,6,9,11,13], [0,2,4,7,12,13], [0,1,4,5,11,13], [0,2,8,9,12,13], [0,1,2,6,10,13], [0,3,7,11,12,13]}.
%Y A103299 Cf. A103296 (Complete rulers with n segments), A103301 (Perfect rulers with n segments).
%K A103299 nonn,hard,more
%O A103299 0,3
%A A103299 _Peter Luschny_, Feb 28 2005
%E A103299 Terms a(20)-a(24) proved by exhaustive search by Fabian Schwartau, _Yannic Schröder_, Lars Wolf, Joerg Schoebel, Feb 22 2021