Number of ways to choose a sequence of distinct integer partitions, one of each prime factor of n (with multiplicity).
A387133
Number of ways to choose a sequence of distinct integer partitions, one of each prime factor of n (with multiplicity).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =2a(4) =7a(5) =6a(6) =15a(7) =0a(8) =6a(9) =14a(10) =56a(11) =6a(12) =101a(13) =30a(14) =21a(15) =0a(16) =297a(17) =12a(18) =490a(19) =14a(20) =45a(21) =112a(22) =1255a(23) =0a(24) =42a(25) =202a(26) =6a(27) =30a(28) =4565a(29) =42
External references
- oeis: A387133