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.

A292411 a(n) = ((prime(n) - 1)/2)^2 modulo prime(n).

Table of values

n a(n)
2 1
3 4
4 2
5 3
6 10
7 13
8 5
9 6
10 22
11 8
12 28
13 31
14 11
15 12
16 40
17 15
18 46
19 17
20 18
21 55
22 20
23 21
24 67
25 73
26 76
27 26
28 27
29 82
30 85
31 32
32 33
33 103
34 35
35 112
36 38
37 118
38 41
39 42
40 130
41 45
42 136
43 48
44 145
45 148
46 50
47 53
48 56
49 57
50 172
51 175
52 60
53 181
54 63
55 193
56 66
57 202
58 68
59 208
60 211
61 71
62 220
63 77
64 78
65 235
66 238
67 83
68 253
69 87
70 262

List of values

[1, 4, 2, 3, 10, 13, 5, 6, 22, 8, 28, 31, 11, 12, 40, 15, 46, 17, 18, 55, 20, 21, 67, 73, 76, 26, 27, 82, 85, 32, 33, 103, 35, 112, 38, 118, 41, 42, 130, 45, 136, 48, 145, 148, 50, 53, 56, 57, 172, 175, 60, 181, 63, 193, 66, 202, 68, 208, 211, 71, 220, 77, 78, 235, 238, 83, 253, 87, 262]

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

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