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 A317589 #6 Aug 01 2018 09:23:07
%S A317589 1,2,3,4,5,6,7,8,9,11,12,13,16,17,18,19,23,25,27,29,30,31,32,36,37,41,
%T A317589 43,47,49,53,59,60,61,64,67,71,73,79,81,83,89,90,97,101,103,107,109,
%U A317589 113,121,125,127,128,131,137,139,149,150,151,157,163,167,169
%N A317589 Heinz numbers of uniformly normal integer partitions.
%C A317589 The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
%C A317589 An integer partition is uniformly normal if either (1) it is of the form (x, x, ..., x) for some x > 0, or (2a) it spans an initial interval of positive integers, and (2b) its multiplicities, sorted in weakly decreasing order, are themselves a uniformly normal integer partition.
%t A317589 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A317589 uninrmQ[q_]:=Or[q=={}||Length[Union[q]]==1,And[Union[q]==Range[Max[q]],uninrmQ[Sort[Length/@Split[q],Greater]]]];
%t A317589 Select[Range[1000],uninrmQ[primeMS[#]]&]
%Y A317589 Cf. A055932, A056239, A181819, A182850, A296150, A304687, A304818, A317089, A317090, A317245, A317246, A317492, A317588, A317590.
%K A317589 nonn
%O A317589 1,2
%A A317589 _Gus Wiseman_, Aug 01 2018