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 A104305 #15 Mar 25 2022 09:28:27 %S A104305 1,1,2,2,3,3,4,4,4,5,5,6,6,7,7,8,7,9,9,10,10,9,9,12,12,12,13,11,12,14, %T A104305 15,15,16,14,15,7,18,18,19,17,18,16,7,21,22,22,21,20,21,20,25,25,25, %U A104305 26,25,24,25,24,28,29,29,30,29,28,29,28,11,11,33,34,33,33,34,32,31,9,10,11 %N A104305 Largest possible difference between consecutive marks that can occur amongst all possible perfect rulers of length n. %C A104305 For nomenclature related to perfect and optimal rulers see Peter Luschny's "Perfect Rulers" web pages. %H A104305 F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, <a href="/A104305/b104305.txt">Table of n, a(n) for n = 1..208</a> [a(212), a(213) commented out by _Georg Fischer_, Mar 25 2022] %H A104305 Peter Luschny, <a href="http://www.luschny.de/math/rulers/introe.html">Perfect and Optimal Rulers.</a> A short introduction. %H A104305 Hugo Pfoertner, <a href="http://www.randomwalk.de/scimath/diffset/consdifs.txt">Largest and smallest maximum differences of consecutive marks of perfect rulers.</a> %H A104305 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 A104305 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 A104305 <a href="/index/Per#perul">Index entries for sequences related to perfect rulers.</a> %e A104305 There are 6 perfect rulers of length 13: [0,1,2,6,10,13], [0,1,4,5,11,13], [0,1,6,9,11,13] and their mirror images. The maximum difference between adjacent marks occurs for the second ruler between marks "5" and "11". Therefore a(13)=6. %Y A104305 Cf. A104306 corresponding occurrence counts. %K A104305 nonn %O A104305 1,3 %A A104305 _Hugo Pfoertner_, Feb 28 2005