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,4

Links

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

Crossrefs

Cf. A230865, A230643.

Sequence in context: A306211 A131714 A130196 * A158209 A234538 A119646

Adjacent sequences: A230863 A230864 A230865 * A230867 A230868 A230869

Keyword

nonn,base

Author

N. J. A. Sloane, Nov 05 2013

Status

approved