Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #22 Jan 14 2024 12:31:28
%S 1,1,1,3,3,4,5,9,11,14,16,23,25,31,33,39,46,49,60,64,68,81,86,95,105,
%T 116,121,138,144,157,169,183,189,203,218,233,248,256,281,289,307,324,
%U 333,361,371,390,410,431,452,473,484,518,529
%N Least k for which the integers floor(4*k/m) for m=2,3,...,n are distinct.
%t lkid[n_]:=Module[{k=1},While[Max[Tally[Floor[(4k)/Range[2,n]]][[All, 2]]]> 1,k++];k]; Array[lkid,60] (* _Harvey P. Dale_, Jun 18 2018 *)
%o (PARI) a(n) = my(k=1); while(#Set(vector(n-1, m, 4*k\(m+1))) != n-1, k++); k; \\ _Michel Marcus_, Apr 26 2021
%Y Cf. A043549, A043550, A043552.
%K nonn
%O 1,4
%A _Clark Kimberling_