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 A319328 #8 Sep 19 2018 09:17:01
%S A319328 165,255,385,465,561,595,615,759,885,935,1001,1005,1015,1023,1045,
%T A319328 1085,1173,1245,1309,1353,1435,1455,1505,1547,1581,1615,1635,1705,
%U A319328 1771,1905,1947,2065,2091,2139,2211,2235,2255,2345,2355,2365,2387,2397,2409,2431,2465
%N A319328 Heinz numbers of integer partitions such that not every distinct submultiset has a different GCD but every distinct submultiset has a different LCM.
%C A319328 The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
%C A319328 The first term of this sequence absent from A302696 (numbers whose prime indices are pairwise coprime) is 1001 with prime indices {4,5,6}.
%e A319328 The sequence of partitions whose Heinz numbers belong to this sequence begins (5,3,2), (7,3,2), (5,4,3), (11,3,2), (7,5,2), (7,4,3), (13,3,2), (9,5,2), (17,3,2), (7,5,3).
%t A319328 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A319328 Select[Range[10000],UnsameQ@@primeMS[#]&&And[!UnsameQ@@GCD@@@Union[Rest[Subsets[primeMS[#]]]],UnsameQ@@LCM@@@Union[Rest[Subsets[primeMS[#]]]]]&]
%Y A319328 Cf. A056239, A275972, A299702, A301899, A301900, A319315, A319319, A319327.
%K A319328 nonn
%O A319328 1,1
%A A319328 _Gus Wiseman_, Sep 17 2018