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 A115101 #17 Jun 15 2025 11:06:07
%S A115101 1,1,1,1,1,2,2,2,2,2,5,4,7,7,6,10,7,8
%N A115101 Number of distinct prime factors of L(n + F(n)) where F(n) is the Fibonacci number and L(n) is the Lucas number.
%e A115101 If n=1 then L(1 + F(1)) = 3 (prime) and so the first term is 1.
%e A115101 If n=2 then L(2 + F(2)) = 4 = 2^2 and so the second term is also 1.
%e A115101 If n=3 then L(3 + F(3)) = 11 (prime) and so the third term is also 1.
%t A115101 Table[PrimeNu[LucasL[n+Fibonacci[n]]],{n,0,17}] (* _Harvey P. Dale_, Apr 06 2019 *)
%Y A115101 Subsequence of A086598.
%Y A115101 Cf. A000045, A000032, A115051.
%K A115101 more,nonn
%O A115101 0,6
%A A115101 _Parthasarathy Nambi_, Mar 02 2006
%E A115101 More terms from _Sean A. Irvine_, Feb 17 2010
%E A115101 Missing term a(0)=1 inserted by _Max Alekseyev_, Jun 15 2025