This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A094402 #17 Aug 20 2021 04:20:58 %S A094402 1,2,323,6479,11663,18407,19043,23407,34943,35207,39203,44099,47519, %T A094402 51983,53663,65471,78089,79547,82983,86063,94667,104663,109871,121103, %U A094402 139359,142883,157079,168299,195227,196559,200147,233519 %N A094402 Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1. %H A094402 Giovanni Resta, <a href="/A094402/b094402.txt">Table of n, a(n) for n = 1..1000</a> %t A094402 Select[Range[10^5],Divisible[Fibonacci[#+1],#]&&Divisible[LucasL[#]+1,#]&] (* _Giorgos Kalogeropoulos_, Aug 20 2021 *) %o A094402 (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 A094402 Cf. A069107, A094398, A094400. %K A094402 nonn %O A094402 1,2 %A A094402 _Eric Rowland_, May 01 2004 %E A094402 More terms from _Emeric Deutsch_, Apr 13 2005