login
A230866
Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n.
2
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,4
LINKS
CROSSREFS
Sequence in context: A306211 A131714 A130196 * A158209 A234538 A119646
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Nov 05 2013
STATUS
approved