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 #5 Mar 30 2012 18:58:10
%S 4,12,4,12,32,80,32,12,192,32,12,80,448,32,192,80,80,192,80,32,5120,
%T 1024,448,80,2304,448,11264,32,2304,192,32,192,1024,80,5120,192,448,
%U 80,11264,192,53248,5120,524288,1024,192,448,192,80,2304,2304
%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)= j*(2^(j-1)).
%C For a guide to related sequences, see A204892.
%t (See the program at A205122.)
%Y Cf. A205122, A204892.
%K nonn
%O 1,1
%A _Clark Kimberling_, Jan 25 2012