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,4

Links

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

Example

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

Crossrefs

Cf. A139410, A236067, A296138.

Sequence in context: A124327 A346837 A082596 * A321763 A280126 A178536

Adjacent sequences: A296136 A296137 A296138 * A296140 A296141 A296142

Keyword

nonn,base

Author

Chai Wah Wu, Dec 06 2017

Status

approved