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.

A085074 Smallest number a(n) == 1 (mod n) such that the prime signature of n and a(n) is the same.

Table of values

n a(n)
2 3
3 7
4 9
5 11
6 55
7 29
8 4913
9 289
10 21
11 23
12 325
13 53
14 15
15 46
16 81
17 103
18 325
19 191
20 261
21 22
22 111
23 47
24 3625
25 10201
26 183
27 6859
28 477
29 59
30 1771
31 311
32 8587340257
33 34
34 35
35 106
36 1225
37 149
38 39
39 118
40 1161
41 83
42 715
43 173
44 45
45 316
46 93
47 283
48 60625
49 9409
50 801
51 205
52 261
53 107
54 11125

List of values

[3, 7, 9, 11, 55, 29, 4913, 289, 21, 23, 325, 53, 15, 46, 81, 103, 325, 191, 261, 22, 111, 47, 3625, 10201, 183, 6859, 477, 59, 1771, 311, 8587340257, 34, 35, 106, 1225, 149, 39, 118, 1161, 83, 715, 173, 45, 316, 93, 283, 60625, 9409, 801, 205, 261, 107, 11125]