cp's OEIS Frontend

A205117 The number s(j) such that n divides s(k)-s(j), where s(j) is the j-th Lucas number and k is the least positive integer for which such a j with 0 exists.

%I A205117 #14 Jan 22 2018 03:06:02
%S A205117 1,1,1,3,1,1,4,3,11,1,7,11,3,4,3,11,1,11,47,7,18,7,1,4,4,3,47,1,18,3,
%T A205117 843,7,1,29,18,11,3,47,4,7,76,3,4,3,7,1,29,7,3,7,11,1,4,47,47,11,322,
%U A205117 18,76,3
%N A205117 The number s(j) such that n divides s(k)-s(j), where s(j) is the j-th Lucas number and k is the least positive integer for which such a j with 0<j<k exists.
%C A205117 For a guide to related sequences, see A204892.
%H A205117 Robert Israel, <a href="/A205117/b205117.txt">Table of n, a(n) for n = 1..10000</a>
%p A205117 lucas:= gfun:-rectoproc({a(n)=a(n-1)+a(n-2),a(0)=2, a(1)=1},a(n),remember):
%p A205117 f:= proc(n) local j,k,S,t;
%p A205117     S:= [];
%p A205117     for k from 1 do
%p A205117       t:= lucas(k) mod n;
%p A205117       if member(t,S,j) then return lucas(j) fi;
%p A205117       S:= [op(S),t];
%p A205117     od
%p A205117 end proc:
%p A205117 map(f, [$1..100]); # _Robert Israel_, Jan 21 2018
%t A205117 (See the program at A205114.)
%Y A205117 Cf. A205114, A204892.
%K A205117 nonn,look
%O A205117 1,4
%A A205117 _Clark Kimberling_, Jan 22 2012
%E A205117 Name corrected by _Robert Israel_, Jan 21 2018