A230866 Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n.

1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3

Offset: 0

Author

N. J. A. Sloane, Nov 05 2013

Keywords

• nonn
• base

Links

• Donovan Johnson, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A230865, A230643.