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 A043552 #16 Apr 26 2021 11:59:40 %S A043552 1,1,1,2,4,4,4,6,10,13,13,18,18,22,29,34,37,42,45,55,58,65,73,76,84, %T A043552 93,97,106,120,125,130,146,157,163,174,186,199,205,218,238,245,260, %U A043552 274,289,305,312,328,345,362,379,396,405,433,442 %N A043552 Least k for which the integers floor(5*k/m) for m=2,3,...,n are distinct. %o A043552 (PARI) a(n) = my(k=1); while(#Set(vector(n-1, m, 5*k\(m+1))) != n-1, k++); k; \\ _Michel Marcus_, Apr 25 2021 %Y A043552 Cf. A043549, A043550, A043551. %K A043552 nonn %O A043552 1,4 %A A043552 _Clark Kimberling_