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 A358566 #21 Dec 20 2022 12:02:36 %S A358566 1,1,2,1,4,7,6,1,2,2,2,1,2,2,20,1,14,2,2,2,4 %N A358566 Number of distinct spans of length n with no 3-term arithmetic progression, containing zero, and with maximum element smallest possible. %C A358566 Offset by 1 from the same function in the referenced paper, which does not include zero in their count of how long spans are for the "well-spaced rows". %H A358566 Noam Benson-Tilsen, Samuel Brock, Brandon Faunce, Monish Kumar, Noah Dokko Stein, and Joshua Zelinsky, <a href="https://arxiv.org/abs/2107.11706">Total Difference Labeling of Regular Infinite Graphs</a>, arXiv:2107.11706 [math.CO], 2021-2022. %e A358566 a(5)=4 since we have as possible spans 0,1,3,7,8; 0,1,5,6,8; 0,1,5,7,8; 0,2,3,7,8. (It is easy to check that if the maximum term is 7 or lower then there must be fewer than 5 elements in the sequence.) %Y A358566 Cf. A005047. %K A358566 nonn,more %O A358566 1,3 %A A358566 _Joshua Zelinsky_, Nov 22 2022