Let k = A228058(n). a(n) is the number of ways to partition the divisors of k into complementary subsets x and y so that the (k-Sum(x)) and (k-Sum(y)) are coprime.
A325809
Let k = A228058(n). a(n) is the number of ways to partition the divisors of k into complementary subsets x and y so that the (k-Sum(x)) and (k-Sum(y)) are coprime.
Terms
- a(0) =8a(1) =12a(2) =8a(3) =16a(4) =8a(5) =15a(6) =16a(7) =8a(8) =113a(9) =16a(10) =8a(11) =15a(12) =16a(13) =7a(14) =14a(15) =8a(16) =8a(17) =13a(18) =16a(19) =15a(20) =8a(21) =15a(22) =14a(23) =8a(24) =15a(25) =254a(26) =8a(27) =16a(28) =8a(29) =128
External references
- oeis: A325809