A322338 Edge-connectivity of the integer partition with Heinz number n.

0, 1, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 3, 0, 2, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 4, 0, 1, 0, 0, 0, 2

Offset

1,9

Comments

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

The edge-connectivity of an integer partition is the minimum number of parts that must be removed so that the prime factorizations of the remaining parts form a disconnected (or empty) hypergraph.

Links

Table of n, a(n) for n=1..87.

Wikipedia, k-edge-connected graph

Example

2093 is the Heinz number of (9,6,4), corresponding to the multiset partition {{1,1},{1,2},{2,2}}, which can be made disconnected by removing only the part {1,2}, so a(2093) = 1.

Mathematica

primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
csm[s_]:=With[{c=Select[Tuples[Range[Length[s]], 2], And[OrderedQ[#], UnsameQ@@#, Length[Intersection@@s[[#]]]>0]&]}, If[c=={}, s, csm[Sort[Append[Delete[s, List/@c[[1]]], Union@@s[[c[[1]]]]]]]]];
Table[PrimeOmega[n]-Max@@PrimeOmega/@Select[Divisors[n], Length[csm[primeMS/@primeMS[#]]]!=1&], {n, 100}]

Crossrefs

Cf. A001222, A003963, A013922, A054921, A056239, A095983, A112798, A302242, A304714, A304716, A305078, A305079, A322335, A322336, A322337.

Sequence in context: A129182 A116857 A369934 * A158971 A121467 A366073

Adjacent sequences: A322335 A322336 A322337 * A322339 A322340 A322341

Keyword

nonn

Author

Gus Wiseman, Dec 04 2018

Status

approved