Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).

A355732

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).

Terms

    a(0) =1a(1) =3a(2) =7a(3) =9a(4) =53a(5) =21a(6) =311a(7) =27a(8) =49a(9) =159a(10) =8161a(11) =63a(12) =38873a(13) =933a(14) =371a(15) =81a(16) =147a(17) =477a(18) =2177a(19) =24483a(20) =189a(21) =2809a(22) =343a(23) =2799a(24) =1113a(25) =243a(26) =57127a(27) =16483a(28) =441a(29) =1431

External references