login

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”).

A094402
Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.
3
1, 2, 323, 6479, 11663, 18407, 19043, 23407, 34943, 35207, 39203, 44099, 47519, 51983, 53663, 65471, 78089, 79547, 82983, 86063, 94667, 104663, 109871, 121103, 139359, 142883, 157079, 168299, 195227, 196559, 200147, 233519
OFFSET
1,2
LINKS
MATHEMATICA
Select[Range[10^5], Divisible[Fibonacci[#+1], #]&&Divisible[LucasL[#]+1, #]&] (* Giorgos Kalogeropoulos, Aug 20 2021 *)
PROG
(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
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric Rowland, May 01 2004
EXTENSIONS
More terms from Emeric Deutsch, Apr 13 2005
STATUS
approved