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.

A247889 Least number k > 0 such that digsum(n^k) = n, or 0 if no such k exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 3, 3, 0, 13, 0, 4, 0, 0, 4, 3, 3, 4, 0, 0, 7, 0, 0, 7, 5, 4, 0, 0, 0, 13, 0, 0, 7, 0, 6, 5, 0, 0, 0, 0, 0, 0, 7, 6, 0, 0, 0, 7, 0, 0, 0, 0, 8, 6, 0, 0, 0, 7, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 17, 9, 10, 0, 0, 10, 13, 0, 0, 0, 19, 14, 0, 0, 10, 0, 0, 10, 11, 0, 0]