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.

A305706 a(n) = smallest m such that the sum of digits of n^m is greater than n, or 0 if no such m exists.

Table of values

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

List of values

[0, 0, 2, 2, 2, 2, 2, 2, 2, 3, 0, 4, 3, 2, 2, 3, 3, 2, 4, 3, 14, 4, 5, 4, 4, 5, 4, 5, 6, 6, 14, 5, 6, 5, 6, 6, 6, 5, 5, 6, 14, 7, 6, 8, 6, 7, 6, 8, 7, 7, 16, 6, 6, 8, 7, 8, 7, 7, 9, 7, 15, 8, 8, 7, 8, 8, 9, 8, 8, 8, 18, 12, 9, 9, 8, 9, 9, 9, 9, 9, 18, 10, 11, 11, 10, 11, 11, 10, 9, 10, 17, 11, 11, 10, 11, 10, 12, 12, 10, 11, 0]