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 A102294 #18 Jun 28 2025 22:13:06
%S A102294 0,3,5,3,3,5,3,5,3,4,5,4,3,7,4,5,3,5,5,5,3,6,4,5,4,5,6,5,3,11,3,7,4,5,
%T A102294 9,6,2,6,5,6,3,5,4,6,4,6,5,6,3,6,6,5,3,7,5,7,4,4,6,6,2,8,6,8,4,6,6,5,
%U A102294 3,6,5,6,3,5,6,4,4,7,3,8,6,6,6,5,3,6,5,5,4,8,5,5,3,8,6,8,3,7,10,6
%N A102294 Number of prime divisors (with multiplicity) of icosahedral numbers.
%C A102294 Because the cubic factors into n time a quadratic, the icosahedral numbers can never be prime, but can be semiprime (only if n is prime and also n*(5*n^2 - 5*n + 2)/2 is prime, as with n = 31, 61, ...
%H A102294 Amiram Eldar, <a href="/A102294/b102294.txt">Table of n, a(n) for n = 1..10000</a>
%F A102294 a(n) = A001222(A006564(n)) = Bigomega(n*(5*n^2 - 5*n + 2)/2).
%e A102294 IcosahedralNumber(13) = 5083 = 13 * 17 * 23 so Omega(IcosahedralNumber(13)) = 3.
%e A102294 IcosahedralNumber(37) = 123247 = 37 * 3331 so Omega(IcosahedralNumber(37)) = 2, hence the 37th icosahedral number is the smallest to be semiprime.
%t A102294 Table[PrimeOmega[n*(5*n^2-5*n+2)/2],{n,120}] (* _Harvey P. Dale_, Jun 06 2015 *)
%o A102294 (PARI) a(n)=bigomega(n)+bigomega(5*binomial(n,2)+1) \\ _Charles R Greathouse IV_, Mar 09 2012
%Y A102294 Cf. A001222, A006564.
%K A102294 easy,nonn
%O A102294 1,2
%A A102294 _Jonathan Vos Post_, Feb 19 2005