OFFSET
1,2
COMMENTS
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
An integer partition is double-free if no part is twice any other part.
Also numbers n such that if prime(m) divides n then prime(2m) does not divide n, i.e., numbers not divisible by any element of A319613.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..20000
Eric Weisstein's World of Mathematics, Double-Free Set
EXAMPLE
The sequence of all integer partitions whose Heinz numbers belong to the sequence begins: (), (1), (2), (11), (3), (4), (111), (22), (31), (5), (6), (41), (32), (1111), (7), (8), (311), (51), (9), (33), (61), (222), (411).
MATHEMATICA
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Select[Range[100], Intersection[primeMS[#], 2*primeMS[#]]=={}&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 07 2019
STATUS
approved