Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Dec 06 2021 13:24:33
%S 2,4,4,6,6,12,9,9,20,12,12,16,25,16,16,20,36,20,20,36,25,42,25,25,56,
%T 30,36,30,30,36,56,36,42,36,36,42,49,42,64,42,42,72,49,56,49,110,49,
%U 49,100,56,81,56,110,56,56,72,121,64,169,64,81,64,64,100,81,72
%N Least s(k) such that n divides s(k)-s(j) for some j < k, where s(j) = floor((j+1)^2/2)/2.
%C For a guide to related sequences, see A204892.
%t (See the program at A205402.)
%Y Cf. A205402, A204892.
%K nonn
%O 1,1
%A _Clark Kimberling_, Jan 27 2012
%E Definition corrected by _Clark Kimberling_, Dec 05 2021