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.

A085075 Smallest number a(n) == -1 (mod n) such that the prime signature of n and a(n) is the same, or 0 if no such number exists.

Table of values

n a(n)
2 3
3 2
4 0
5 19
6 35
7 13
8 343
9 0
10 39
11 43
12 275
13 103
14 55
15 14
16 0
17 67
18 539
19 37
20 99
21 62
22 21
23 137
24 2375
25 49
26 51
27 4913
28 279
29 173
30 2639
31 61
32 0
33 65
34 33
35 34
36 0
37 73
38 265
39 38
40 999
41 163
42 1595
43 257
44 175
45 44
46 91
47 281
48 29375
49 0
50 99
51 203
52 207
53 211
54 2375
55 219
56 783
57 341
58 57
59 353
60 14399
61 487
62 123

List of values

[3, 2, 0, 19, 35, 13, 343, 0, 39, 43, 275, 103, 55, 14, 0, 67, 539, 37, 99, 62, 21, 137, 2375, 49, 51, 4913, 279, 173, 2639, 61, 0, 65, 33, 34, 0, 73, 265, 38, 999, 163, 1595, 257, 175, 44, 91, 281, 29375, 0, 99, 203, 207, 211, 2375, 219, 783, 341, 57, 353, 14399, 487, 123]