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.

A153095 Least m(n) such that k(n)*m(n)^n*(m(n)^n-1)+j is prime with j= -1 or 1 or both and least possible k(n) with 1

Table of values

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

List of values

[2, 2, 3, 2, 2, 3, 3, 5, 2, 2, 2, 3, 8, 7, 5, 4, 2, 2, 4, 3, 6, 2, 2, 5, 4, 7, 6, 4, 3, 2, 2, 2, 2, 6, 3, 3, 7, 2, 2, 2, 5, 2, 2, 3, 2, 2, 2, 5, 7, 2, 9, 5, 4, 4, 2, 2, 2, 8, 7, 4, 8, 4, 6, 5, 4, 5, 5, 4, 3, 9, 2, 2, 6, 3, 8, 8, 4, 2, 4, 8, 6, 2, 2, 4, 4, 5, 6, 4, 4, 8, 4, 6, 4, 7, 3, 4, 6, 7, 5, 2]