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 A091109 #7 Sep 08 2018 12:46:46 %S A091109 3,8,19,15,41,83,160,122,295,526,911,683,1538,2540,853,4115,3050,6551, %T A091109 10269,15873,11664,24222,8415,36532,54509,39784,80524,117862,171036, %U A091109 124143,246211,351769,72718,499042,360550,703268,984857,353996 %N A091109 Number of occurrences of smallest prime factor in all partitions of n-th composite number: a(n)=A066633(A002808(n), A056608(n)). %e A091109 n=2: A002808(2)=6=2*3 has A000041(6)=11 partitions: 6 = 5+1 = 4+2 = 4+1+1 = 3+3 = 3+2+1 = 3+1+1+1 = 2+2+2 = 2+2+1+1 = 2+1+1+1+1 = 1+1+1+1+1+1, 2 occurs 8 times, therefore a(2)=8. %t A091109 Count[Flatten[IntegerPartitions[#]],FactorInteger[#][[1,1]]]&/@ Select[ Range[ 60],CompositeQ] (* _Harvey P. Dale_, Sep 08 2018 *) %Y A091109 Cf. A002808, A000041, A056608, A020639, A091114. %K A091109 nonn %O A091109 1,1 %A A091109 _Reinhard Zumkeller_, Feb 22 2004