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.

A085324 a(n) is the least exponent so that reverse(n^a(n)) is a prime number. a(n)=0 if no such exponent exists, namely when e.g., n = 3k or n = 11k, k > 1.

Table of values

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

List of values

[0, 1, 1, 2, 1, 0, 1, 8, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 2, 1, 0, 0, 8, 0, 13, 47, 0, 2, 7, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 2, 2, 0, 5, 0, 0, 22, 15, 0, 6, 1, 0, 3, 10, 0, 0, 143, 0, 88, 12, 0, 4, 2, 0, 4, 8, 0, 39, 83, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 8, 0, 6, 11, 0, 2, 28, 0, 0, 2, 0, 1, 1, 0, 292, 1, 0, 1, 1]