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.

A172035 Smallest exponent k > 1 that sum of digits of k-th power of the n-th prime is a prime (n=1,2,...) or 0 if no such k exists.

Table of values

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

List of values

[5, 0, 2, 2, 9, 3, 2, 5, 3, 2, 7, 2, 4, 5, 2, 2, 5, 2, 3, 6, 2, 2, 2, 2, 4, 8, 4, 2, 2, 4, 2, 8, 2, 3, 2, 2, 4, 4, 6, 2, 4, 2, 10, 3, 4, 2, 3, 2, 4, 3, 5, 6, 3, 4, 4, 2, 2, 2, 2, 2, 3, 4, 3, 3, 3, 5, 3, 3, 8, 2, 3, 12, 2, 3, 2, 5, 2, 3, 8, 16, 8, 3, 4, 2, 3, 2, 4, 2, 2, 5, 7, 4, 3, 8, 3, 2, 6, 2, 3, 6, 2, 2, 10]