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 #17 Aug 20 2021 04:20:58
%S 1,2,323,6479,11663,18407,19043,23407,34943,35207,39203,44099,47519,
%T 51983,53663,65471,78089,79547,82983,86063,94667,104663,109871,121103,
%U 139359,142883,157079,168299,195227,196559,200147,233519
%N Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.
%H Giovanni Resta, <a href="/A094402/b094402.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[Range[10^5],Divisible[Fibonacci[#+1],#]&&Divisible[LucasL[#]+1,#]&] (* _Giorgos Kalogeropoulos_, Aug 20 2021 *)
%o (PARI) is(n)=(Mod([0,1;1,1],n)^(n+1)*[0;1])[1,1]==0 && (Mod([0,1;1,1],n)^n*[2;1])[1,1]==-1 \\ _Charles R Greathouse IV_, Nov 04 2016
%Y Cf. A069107, A094398, A094400.
%K nonn
%O 1,2
%A _Eric Rowland_, May 01 2004
%E More terms from _Emeric Deutsch_, Apr 13 2005