login
A037134
Number of ways of writing n as a+b where a is abundant (or perfect), b is deficient (or perfect) and s(a)-a=b-s(b) (s(x)=sigma(x)-x).
2
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1
OFFSET
1,56
EXAMPLE
E.g. 17=5+12, 5-s(5)=s(12)-12, a(17)=1; 34=6+28, a(34)=1.
CROSSREFS
Sequence in context: A369308 A212434 A227186 * A254612 A363886 A227189
KEYWORD
nonn
STATUS
approved