Least k such that there are exactly n ways to choose a sequence of divisors, one of each prime index of k (with multiplicity), such that the result has no common divisor > 1.
A355738
Least k such that there are exactly n ways to choose a sequence of divisors, one of each prime index of k (with multiplicity), such that the result has no common divisor > 1.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =9a(4) =15a(5) =49a(6) =35a(7) =27a(8) =45a(9) =98a(10) =63a(11) =105a(12) =171a(13) =117a(14) =81a(15) =135a(16) =245a(17) =343a(18) =273a(19) =549a(20) =189a(21) =1083a(22) =315a(23) =5618a(24) =741a(25) =686a(26) =507a(27) =513a(28) =351a(29) =243
External references
- oeis: A355738