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

%I #10 Nov 01 2013 14:11:34

%S 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,

%T 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,

%U 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

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

%C Number of times 2n appears in A230641.

%H Donovan Johnson, <a href="/A230643/b230643.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>

%Y Cf. A230641, A230642.

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

%K nonn,base

%O 0,3

%A _N. J. A. Sloane_, Oct 31 2013