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 A324753 #10 Aug 22 2019 08:24:48
%S A324753 1,1,1,2,2,4,5,7,8,14,16,23,29,40,49,66,81,109,133,172,211,274,332,
%T A324753 419,511,640,775,965,1165,1434,1730,2109,2530,3083,3683,4447,5308,
%U A324753 6375,7573,9062,10730,12786,15104,17909,21095,24937,29284,34488,40421,47450
%N A324753 Number of integer partitions of n containing all prime indices of their parts.
%C A324753 These could be described as transitive integer partitions.
%C A324753 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%e A324753 The a(1) = 1 through a(8) = 8 integer partitions:
%e A324753 (1) (11) (21) (211) (41) (321) (421) (3221)
%e A324753 (111) (1111) (221) (411) (2221) (4211)
%e A324753 (2111) (2211) (3211) (22211)
%e A324753 (11111) (21111) (4111) (32111)
%e A324753 (111111) (22111) (41111)
%e A324753 (211111) (221111)
%e A324753 (1111111) (2111111)
%e A324753 (11111111)
%t A324753 Table[Length[Select[IntegerPartitions[n],SubsetQ[#,PrimePi/@First/@Join@@FactorInteger/@DeleteCases[#,1]]&]],{n,0,30}]
%Y A324753 The subset version is A324736. The strict case is A324748. The Heinz number version is A290822. An infinite version is A324698.
%Y A324753 Cf. A000720, A000837, A001462, A007097, A051424, A112798, A276625, A279861, A290689, A290760.
%Y A324753 Cf. A324697, A324737.
%K A324753 nonn
%O A324753 0,4
%A A324753 _Gus Wiseman_, Mar 16 2019