T(n, k) is the largest number that can be formed by multiplying k primes prime(i1+0),...,prime(ik+k-1) such that i1+...+ik = n. Triangle read by rows.
A274608
T(n, k) is the largest number that can be formed by multiplying k primes prime(i1+0),...,prime(ik+k-1) such that i1+...+ik = n. Triangle read by rows.
Terms
- a(0) =2a(1) =3a(2) =6a(3) =5a(4) =10a(5) =30a(6) =7a(7) =15a(8) =42a(9) =210a(10) =11a(11) =22a(12) =70a(13) =330a(14) =2310a(15) =13a(16) =35a(17) =110a(18) =462a(19) =2730a(20) =30030a(21) =17a(22) =55a(23) =165a(24) =770a(25) =4290a(26) =39270a(27) =510510a(28) =19a(29) =77
External references
- oeis: A274608