Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A371734

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Maximal length of a factorization of n into factors > 1 all having different sums of prime indices.
(history; published version)
#7 by Peter Luschny at Sun Apr 14 03:49:55 EDT 2024
STATUS

reviewed

approved

#6 by Joerg Arndt at Sun Apr 14 03:02:49 EDT 2024
STATUS

proposed

reviewed

#5 by Gus Wiseman at Sun Apr 14 01:45:35 EDT 2024
STATUS

editing

proposed

#4 by Gus Wiseman at Sun Apr 14 01:45:32 EDT 2024
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.

CROSSREFS

For same sums instead of different sums we have A371733.

A321142 and A371794 count non-biquanimous strict partitions.

A371789 counts non-quanimous sets, differences A371790.

A371796 counts quanimous sets, differences A371797.

Cf. A035470, A279787, A305551, A321142, A322794, A326515, A326518, A326534, A336137, A371783, A371789, A371791.

#3 by Gus Wiseman at Sat Apr 13 17:16:45 EDT 2024
CROSSREFS

For set partitions instead of factorizations binary indices we have A000120, same sums A371735.

#2 by Gus Wiseman at Sat Apr 13 17:04:23 EDT 2024
NAME

allocated for Gus WisemanMaximal length of a factorization of n into factors > 1 all having different sums of prime indices.

DATA

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

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.

Factorizations into factors > 1 all having different sums of prime indices are counted by A321469.

LINKS

Gus Wiseman, <a href="/A038041/a038041.txt">Sequences counting and ranking multiset partitions whose part lengths, sums, or averages are constant or strict.</a>

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 instead of factorizations we have A000120, same sums A371735.

Positions of 1's are A000430.

Positions of terms > 1 are A080257.

Factorizations of this type are counted by A321469, same sums A321455.

For same sums instead of different sums we have A371733.

A001055 counts factorizations.

A002219 (aerated) counts biquanimous partitions, ranks A357976.

A112798 lists prime indices, reverse A296150, length A001222, sum A056239.

A321142 and A371794 count non-biquanimous strict partitions.

A321451 counts non-quanimous partitions, ranks A321453.

A321452 counts quanimous partitions, ranks A321454.

A371789 counts non-quanimous sets, differences A371790.

A371796 counts quanimous sets, differences A371797.

Cf. A035470, A279787, A305551, A322794, A326515, A326518, A326534, A336137, A371783, A371791.

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Apr 13 2024

STATUS

approved

editing

#1 by Gus Wiseman at Fri Apr 05 03:33:31 EDT 2024
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved