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 A111353 #11 Mar 31 2019 15:10:00
%S A111353 2,1,3,3,3,3,3,3,4,5,2,3,4,2,3,7,4,5,5,2,4,4,3,5,3,1,4,3,3,2,4,5,3,3,
%T A111353 5,3,6,4,2,2,3,4,5,4,4,3,4,4,4,3,5,3,5,5,6,3,4,4,3,3,3,5,6,3,4,6,4,4,
%U A111353 4,4,4,3,6,7,3,4,4,7,2,8
%N A111353 Number of distinct prime factors of P(6*n+1) where P(m) is the partition number.
%F A111353 a(n) = A087175(6n+1). - _R. J. Mathar_, Aug 25 2011
%e A111353 If n=1 then the number of distinct prime factors of P(6*n+1) = P(7) is 2, which is the first term in the sequence.
%t A111353 Table[Length[FactorInteger[PartitionsP[6n + 1]]], {n, 1, 80}] (* _Stefan Steinerberger_, Feb 17 2006 *)
%t A111353 PrimeNu[PartitionsP[6*Range[80]+1]] (* _Harvey P. Dale_, Mar 31 2019 *)
%K A111353 nonn
%O A111353 1,1
%A A111353 _Parthasarathy Nambi_, Nov 05 2005
%E A111353 More terms from _Stefan Steinerberger_, Feb 17 2006