login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319119 Number of multimin tree-factorizations of Heinz numbers of integer partitions of n. 2
1, 3, 9, 37, 173, 921, 5185, 30497, 184469, 1140413, 7170085, 45704821 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A multimin factorization of n is an ordered factorization of n into factors greater than 1 such that the sequence of minimal primes dividing each factor is weakly increasing. A multimin tree-factorization of n is either the number n itself or a sequence of multimin tree-factorizations, one of each factor in a multimin factorization of n with at least two factors.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
LINKS
EXAMPLE
The a(3) = 9 multimin tree-factorizations:
5, 6, 8,
(2*3), (2*4), (4*2), (2*2*2),
(2*(2*2)), ((2*2)*2).
Or as series-reduced plane trees of multisets:
3, 12, 111,
(1,2), (1,11), (11,1), (1,1,1),
(1,(1,1)), ((1,1),1).
MATHEMATICA
facs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#1, d]&)/@Select[facs[n/d], Min@@#1>=d&], {d, Rest[Divisors[n]]}]];
mmftrees[n_]:=Prepend[Join@@(Tuples[mmftrees/@#]&/@Select[Join@@Permutations/@Select[facs[n], Length[#]>1&], OrderedQ[FactorInteger[#][[1, 1]]&/@#]&]), n];
Table[Sum[Length[mmftrees[k]], {k, Times@@Prime/@#&/@IntegerPartitions[n]}], {n, 7}]
CROSSREFS
Sequence in context: A119856 A077365 A366433 * A006229 A321734 A008986
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Sep 10 2018
EXTENSIONS
a(11)-a(12) from Robert Price, Sep 14 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:16 EDT 2024. Contains 371905 sequences. (Running on oeis4.)