cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 1
2 0
3 1
4 2
5 1
6 0
7 1
8 1
9 1
10 0
11 0
12 0
13 0
14 0
15 2
16 1
17 1
18 1
19 2
20 1
21 3
22 2
23 1
24 1
25 3
26 0
27 2
28 1
29 2
30 2
31 3
32 1
33 3
34 1
35 3
36 2
37 1
38 3
39 0
40 2
41 1
42 2
43 0
44 1
45 0
46 0
47 1
48 3
49 3
50 3
51 0
52 2
53 3
54 0
55 2
56 1
57 0
58 3
59 2
60 0
61 2
62 2
63 5
64 1
65 3
66 4
67 2
68 0
69 3
70 0
71 1
72 1
73 2
74 3
75 0
76 1
77 1
78 3
79 0
80 3
81 0
82 2
83 5
84 0
85 1
86 4
87 0

List of values

[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]