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.

A332029 a(n) is the least number k > 0 such that n^k - (n mod 2) - 1 is prime, or 0 if no such number exists.

Table of values

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

List of values

[0, 2, 2, 1, 1, 1, 1, 1, 1, 0, 4, 1, 1, 1, 1, 0, 6, 1, 1, 1, 1, 0, 24, 1, 1, 0, 2, 0, 2, 1, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 4, 1, 1, 1, 1, 0, 2, 1, 1, 0, 8, 0, 4, 1, 1, 0, 12, 0, 4, 1, 1, 1, 1, 0, 8, 0, 3, 1, 1, 0, 2, 1, 1, 1, 1, 0, 2, 0, 38, 1, 1, 0, 4, 1, 1, 0, 4]