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

A327076
Maximum divisor of n that is 1 or connected.
18
1, 2, 3, 2, 5, 3, 7, 2, 9, 5, 11, 3, 13, 7, 5, 2, 17, 9, 19, 5, 21, 11, 23, 3, 25, 13, 27, 7, 29, 5, 31, 2, 11, 17, 7, 9, 37, 19, 39, 5, 41, 21, 43, 11, 9, 23, 47, 3, 49, 25, 17, 13, 53, 27, 11, 7, 57, 29, 59, 5, 61, 31, 63, 2, 65, 11, 67, 17, 23, 7, 71, 9, 73
OFFSET
1,2
COMMENTS
A number n with prime factorization n = prime(m_1)^s_1 * ... * prime(m_k)^s_k is connected if the simple labeled graph with vertex set {m_1,...,m_k} and edges between any two vertices with a common divisor greater than 1 is connected. Connected numbers are listed in A305078, which is the union of this sequence without 1.
Also the maximum MM-number (A302242) of a connected subset of the multiset of multisets with MM-number n.
FORMULA
If n is in A305078, then a(n) = n.
MATHEMATICA
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
zsm[s_]:=With[{c=Select[Subsets[Range[Length[s]], {2}], GCD@@s[[#]]>1&]}, If[c=={}, s, zsm[Sort[Append[Delete[s, List/@c[[1]]], LCM@@s[[c[[1]]]]]]]]];
Table[Max[Select[Divisors[n], Length[zsm[primeMS[#]]]<=1&]], {n, 30}]
CROSSREFS
Positions of prime numbers are A302569.
Connected numbers are A305078.
Sequence in context: A164858 A192330 A320028 * A215041 A347241 A338668
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 05 2019
STATUS
approved