cp's OEIS Frontend

A296139 a(n) is the number of positive integers m such that m = n^d_1 + n^d_2 + ... + n^d_k where d_k represents the k-th digit in the decimal expansion of m.

%I A296139 #11 Dec 07 2017 16:52:06
%S A296139 1,0,1,2,1,0,1,1,1,0,0,0,0,0,2,1,1,1,2,1,3,2,1,1,3,0,2,1,2,2,3,1,3,1,
%T A296139 3,2,1,3,0,2,1,2,0,1,0,0,1,3,3,3,0,2,3,0,2,1,0,3,2,0,2,2,5,1,3,4,2,0,
%U A296139 3,0,1,1,2,3,0,1,1,3,0,3,0,2,5,0,1,4,0
%N A296139 a(n) is the number of positive integers m such that m = n^d_1 + n^d_2 + ... + n^d_k where d_k represents the k-th digit in the decimal expansion of m.
%H A296139 Chai Wah Wu, <a href="/A296139/b296139.txt">Table of n, a(n) for n = 1..500</a>
%e A296139 a(4) = 2 since 4624 = 4^4 + 4^6 + 4^2 + 4^4 and 595968 = 4^5 + 4^9 + 4^5 + 4^9 + 4^6 + 4^8 and these are the only such numbers (see A139410).
%Y A296139 Cf. A139410, A236067, A296138.
%K A296139 nonn,base
%O A296139 1,4
%A A296139 _Chai Wah Wu_, Dec 06 2017