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

A378175
Triangle T(n,k) read by rows in which n-th row lists in increasing order all multiplicative partitions mu of n (with factors > 1) encoded as Product_{j in mu} prime(j); n>=1, 1<=k<=A001055(n).
4
1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 27, 23, 25, 29, 33, 31, 35, 37, 39, 45, 41, 43, 51, 47, 55, 49, 53, 57, 63, 81, 59, 61, 65, 69, 75, 67, 71, 77, 87, 99, 73, 85, 79, 93, 83, 89, 91, 95, 105, 111, 117, 135, 97, 121, 101, 123, 103, 115, 125, 107, 119, 129, 153
OFFSET
1,2
LINKS
FORMULA
T(prime(n),1) = T(A000040(n),1) = A006450(n).
EXAMPLE
The multiplicative partitions of n=8 are {[8], [4,2], [2,2,2]}, encodings give {prime(8), prime(4)*prime(2), prime(2)^3} = {19, 7*3, 3^3} => row 8 = [19, 21, 27].
For n=1 the empty partition [] gives the empty product 1.
Triangle T(n,k) begins:
1 ;
3 ;
5 ;
7, 9 ;
11 ;
13, 15 ;
17 ;
19, 21, 27 ;
23, 25 ;
29, 33 ;
31 ;
35, 37, 39, 45 ;
41 ;
43, 51 ;
47, 55 ;
49, 53, 57, 63, 81 ;
59 ;
...
MAPLE
b:= proc(n) option remember; `if`(n=1, {1}, {seq(map(x-> x*
ithprime(d), b(n/d))[], d=numtheory[divisors](n) minus {1})})
end:
T:= n-> sort([b(n)[]])[]:
seq(T(n), n=1..28);
CROSSREFS
Row sums give A378176.
Row lengths give A001055.
Column k=1 gives A318871.
Rightmost elements of rows give A064988.
Sorted terms give A005408.
Sequence in context: A062505 A230104 A093031 * A305468 A143452 A376342
KEYWORD
nonn,tabf
AUTHOR
Alois P. Heinz, Nov 18 2024
STATUS
approved