This question already has an answer here:
The sum of thirteen positive integers is 79633. If placed appropriately on the vertices of this graph, two of them will be joined by an edge if and only if they have a common divisor greater than 1 (that is, they are not relatively prime). In non-decreasing order, what are those thirteen integers?
Related problem: Labelling a Snow Flake Graph to Attain Minimum Sum