login
A358566
Number of distinct spans of length n with no 3-term arithmetic progression, containing zero, and with maximum element smallest possible.
0
1, 1, 2, 1, 4, 7, 6, 1, 2, 2, 2, 1, 2, 2, 20, 1, 14, 2, 2, 2, 4
OFFSET
1,3
COMMENTS
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".
LINKS
Noam Benson-Tilsen, Samuel Brock, Brandon Faunce, Monish Kumar, Noah Dokko Stein, and Joshua Zelinsky, Total Difference Labeling of Regular Infinite Graphs, arXiv:2107.11706 [math.CO], 2021-2022.
EXAMPLE
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.)
CROSSREFS
Cf. A005047.
Sequence in context: A123242 A322941 A217205 * A139769 A357470 A326894
KEYWORD
nonn,more
AUTHOR
Joshua Zelinsky, Nov 22 2022
STATUS
approved