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.

A381864 Numbers k in A024619 such that p^(m+1) == r (mod k) where r is also in A024619 for all p | n.

Table of values

n a(n)
1 15
2 33
3 35
4 44
5 45
6 51
7 63
8 65
9 66
10 69
11 70
12 75
13 76
14 77
15 80
16 85
17 87
18 88
19 90
20 91
21 92
22 95
23 99
24 102
25 104
26 105
27 115
28 119
29 123
30 130
31 133
32 135
33 138
34 140
35 141
36 143
37 144
38 145
39 152
40 153
41 154
42 159
43 160
44 161
45 170
46 172
47 174
48 175
49 176
50 177
51 180
52 184
53 185
54 187
55 188
56 189
57 190

List of values

[15, 33, 35, 44, 45, 51, 63, 65, 66, 69, 70, 75, 76, 77, 80, 85, 87, 88, 90, 91, 92, 95, 99, 102, 104, 105, 115, 119, 123, 130, 133, 135, 138, 140, 141, 143, 144, 145, 152, 153, 154, 159, 160, 161, 170, 172, 174, 175, 176, 177, 180, 184, 185, 187, 188, 189, 190]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.