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

%I #8 Nov 05 2013 18:16:26

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

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

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

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

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

%Y Cf. A230865, A230643.

%K nonn,base

%O 0,4

%A _N. J. A. Sloane_, Nov 05 2013