login

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”).

A301900
Heinz numbers of strict non-knapsack partitions. Squarefree numbers such that more than one divisor has the same Heinz weight A056239(d).
13
30, 70, 154, 165, 210, 273, 286, 330, 390, 442, 462, 510, 546, 561, 570, 595, 646, 690, 714, 741, 770, 858, 870, 874, 910, 930, 1045, 1110, 1122, 1155, 1173, 1190, 1230, 1254, 1290, 1326, 1330, 1334, 1365, 1410, 1430, 1482, 1495, 1590, 1610, 1653, 1770
OFFSET
1,1
COMMENTS
An integer partition is knapsack if every distinct submultiset has a different sum. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
FORMULA
Complement of A005117 in A299702.
EXAMPLE
Sequence of strict non-knapsack partitions begins: (321), (431), (541), (532), (4321), (642), (651), (5321), (6321), (761), (5421), (7321), (6421), (752), (8321), (743), (871), (9321), (7421), (862), (5431), (6521).
MATHEMATICA
wt[n_]:=If[n===1, 0, Total[Cases[FactorInteger[n], {p_, k_}:>k*PrimePi[p]]]];
Select[Range[1000], SquareFreeQ[#]&&!UnsameQ@@wt/@Divisors[#]&]
KEYWORD
nonn
AUTHOR
Gus Wiseman, Mar 28 2018
STATUS
approved