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.

A212912 Numbers k such that 3^(m+3) == 9 (mod m) where m = (k-1)^2 - 1.

Table of values

n a(n)
1 3
2 5
3 7
4 11
5 17
6 37
7 47
8 53
9 67
10 97
11 101
12 121
13 211
14 257
15 367
16 379
17 457
18 617
19 911
20 1091
21 1237
22 1297
23 1361
24 1549
25 2003
26 2557
27 2851
28 2897
29 3517
30 3733
31 4201
32 4357
33 5209
34 6481
35 7621
36 8461
37 8647
38 8689
39 10253
40 10457
41 10631
42 11953
43 13729
44 14401
45 14951
46 17431
47 17837

List of values

[3, 5, 7, 11, 17, 37, 47, 53, 67, 97, 101, 121, 211, 257, 367, 379, 457, 617, 911, 1091, 1237, 1297, 1361, 1549, 2003, 2557, 2851, 2897, 3517, 3733, 4201, 4357, 5209, 6481, 7621, 8461, 8647, 8689, 10253, 10457, 10631, 11953, 13729, 14401, 14951, 17431, 17837]