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 #9 Apr 09 2015 15:42:17
%S 3,3,4,7,11,7,11,11,29,11,18,47,29,18,18,123,18,29,123,47,123,29,47,
%T 76,29,29,2207,29,47,123,2207,199,199,199,123,47,521,123,199,47,199,
%U 843,47,47,322,47,76,199,199,2207,521,521,322,2207,322,123,3571
%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=is the j-th Lucas number.
%C For a guide to related sequences, see A204892.
%t (See the program at A205114.)
%Y Cf. A205114, A204892.
%K nonn
%O 1,1
%A _Clark Kimberling_, Jan 22 2012