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 A168514 #12 Jun 24 2023 04:22:11
%S A168514 1,1,1,2,2,2,2,2,2,4,4,2,4,5,2,4,3,3,4,3,3,8,4,2,4,5,3,5,5,5,4,4,2,6,
%T A168514 6,2,7,9,4,6,5,4,6,5,4,12,4,4,6,5,5,7,6,6,7,6,4,10,6,2,7,9,4,6,5,4,6,
%U A168514 7,6,13,7,4,7,7,5,8,5,8,6,4,5,10,8,4,7,11,5,8,9,7,8,6,4,15,5,3,7,10,7,8,7,8
%N A168514 Number of prime divisors (counted with multiplicity) of Fibonacci(n)+1.
%C A168514 Always greater than 1 for any n >= 4.
%D A168514 Jason Earls, "Fibonacci," Mathematical Bliss, Pleroma Publications, 2009, pages 60-64. ASIN: B002ACVZ6O
%H A168514 Amiram Eldar, <a href="/A168514/b168514.txt">Table of n, a(n) for n = 1..2803</a>
%F A168514 a(n) = Omega(Fibonacci(n) + 1) = A001222(A001611(n)). - _Wesley Ivan Hurt_, Feb 04 2014
%t A168514 Table[PrimeOmega[Fibonacci[n] + 1], {n, 100}] (* _Wesley Ivan Hurt_, Feb 04 2014 *)
%o A168514 (PARI) A168514(n) = bigomega(fibonacci(n)+1) \\ _Michael B. Porter_, Mar 02 2010
%Y A168514 Cf. A000045, A001222, A001611.
%K A168514 nonn
%O A168514 1,4
%A A168514 _Jason Earls_, Nov 28 2009