|
| |
|
|
A371734
|
|
Maximal length of a factorization of n into factors > 1 all having different sums of prime indices.
|
|
2
|
|
|
|
0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 2, 3, 2, 2, 1, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 2, 3, 1, 3, 2, 2, 1, 3, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,6
|
|
|
COMMENTS
|
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Sum of prime indices is given by A056239.
Factorizations into factors > 1 all having different sums of prime indices are counted by A321469.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
The factorizations of 90 of this type are (2*3*15), (2*5*9), (2*45), (3*30), (5*18), (6*15), (90), so a(90) = 3.
|
|
|
MATHEMATICA
|
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
hwt[n_]:=Total[Cases[FactorInteger[n], {p_, k_}:>PrimePi[p]*k]];
Table[Max[Length/@Select[facs[n], UnsameQ@@hwt/@#&]], {n, 100}]
|
|
|
CROSSREFS
|
For set partitions of binary indices we have A000120, same sums A371735.
Positions of terms > 1 are A080257.
Factorizations of this type are counted by A321469, same sums A321455.
For same instead of different sums we have A371733.
Cf. A035470, A279787, A305551, A321142, A322794, A326515, A326518, A326534, A336137, A371783, A371789, A371791.
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
