The total number of combinations for presenting the set of numbers 1 <= k <= sigma(n) as sums of distinct divisors of n.
A307224
The total number of combinations for presenting the set of numbers 1 <= k <= sigma(n) as sums of distinct divisors of n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =8a(6) =0a(7) =1a(8) =0a(9) =0a(10) =0a(11) =1088391168a(12) =0a(13) =0a(14) =0a(15) =1a(16) =0a(17) =2985984a(18) =0a(19) =2097152a(20) =0a(21) =0a(22) =0a(24) =0a(25) =0a(26) =0a(27) =128a(28) =0a(30) =0a(31) =1
External references
- oeis: A307224