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

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

Offset: 0

Author

N. J. A. Sloane, Oct 31 2013

Keywords

• nonn
• base

Comments

Number of times 2n appears in A230641.

Links

• Donovan Johnson, Table of n, a(n) for n = 0..10000
• Index entries for Colombian or self numbers and related sequences

Crossrefs

Cf. A230641, A230642.

Related base-3 sequences: A053735, A134451, A230641, A230642, A230643, A230853, A230854, A230855, A230856, A230639, A230640, A010063 (trajectory of 1)