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.

A087428 a(n) = [(p-1)/2 * (q-1)/2] mod p where p = (n+1)th odd prime, q = n-th odd prime.

Table of values

n a(n)
1 2
2 6
3 4
4 4
5 14
6 15
7 7
8 9
9 24
10 11
11 32
12 33
13 13
14 15
15 46
16 16
17 52
18 19
19 19
20 61
21 22
22 24
23 75
24 77
25 78
26 28
27 28
28 86
29 99
30 34
31 36
32 105
33 40
34 114
35 41
36 124
37 43
38 45
39 136
40 46
41 146
42 49
43 149
44 150
45 56
46 59
47 58
48 58
49 176
50 181
51 61
52 191
53 66
54 199
55 69
56 204
57 71
58 212
59 213
60 76
61 234
62 79
63 79
64 239
65 252
66 86

List of values

[2, 6, 4, 4, 14, 15, 7, 9, 24, 11, 32, 33, 13, 15, 46, 16, 52, 19, 19, 61, 22, 24, 75, 77, 78, 28, 28, 86, 99, 34, 36, 105, 40, 114, 41, 124, 43, 45, 136, 46, 146, 49, 149, 150, 56, 59, 58, 58, 176, 181, 61, 191, 66, 199, 69, 204, 71, 212, 213, 76, 234, 79, 79, 239, 252, 86]

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

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