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.

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, 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, 3, 0, 1, 1, 2, 3, 0, 1, 1, 3, 0, 3, 0, 2, 5, 0, 1, 4, 0

Offset: 1

Author

Chai Wah Wu, Dec 06 2017

Keywords

• nonn
• base

Examples

			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).
		

Links

• Chai Wah Wu, Table of n, a(n) for n = 1..500

Crossrefs

Cf. A139410, A236067, A296138.