Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Apr 13 2019 08:11:43
%S 6,9,10,12,14,15,18,21,22,24,25,26,27,33,34,35,36,38,39,46,48,49,51,
%T 54,55,57,58,62,65,69,72,74,77,81,82,85,86,87,91,93,94,95,96,106,108,
%U 111,115,118,119,121,122,123,129,133,134,141,142,143,144,145,146
%N Heinz numbers of integer partitions such that lesser of the maximum part and the number of parts is 2.
%C The enumeration of these partitions by sum is given by A265283.
%C The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
%e The sequence of terms together with their prime indices begins:
%e 6: {1,2}
%e 9: {2,2}
%e 10: {1,3}
%e 12: {1,1,2}
%e 14: {1,4}
%e 15: {2,3}
%e 18: {1,2,2}
%e 21: {2,4}
%e 22: {1,5}
%e 24: {1,1,1,2}
%e 25: {3,3}
%e 26: {1,6}
%e 27: {2,2,2}
%e 33: {2,5}
%e 34: {1,7}
%e 35: {3,4}
%e 36: {1,1,2,2}
%e 38: {1,8}
%e 39: {2,6}
%e 46: {1,9}
%t Select[Range[300],Min[PrimeOmega[#],PrimePi[FactorInteger[#][[-1,1]]]]==2&]
%Y Cf. A056239, A061395, A093641, A112798, A252464, A257541, A263297, A265283, A325224, A325225, A325227, A325230, A325232.
%K nonn
%O 1,1
%A _Gus Wiseman_, Apr 12 2019