Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.
A164988
Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =3a(7) =2a(8) =3a(9) =3a(10) =7a(11) =2a(12) =10a(13) =9a(14) =7a(15) =9a(16) =21a(17) =8a(18) =29a(19) =12a(20) =31a(21) =67a(22) =56a(23) =11a(24) =79a(25) =167a(26) =105a(27) =85a(28) =137a(29) =37
External references
- oeis: A164988