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.

A163366 a(n) = (-1)^floor((prime(n)+2)/2) mod prime(n).

Table of values

n a(n)
1 1
2 1
3 4
4 1
5 1
6 12
7 16
8 1
9 1
10 28
11 1
12 36
13 40
14 1
15 1
16 52
17 1
18 60
19 1
20 1
21 72
22 1
23 1
24 88
25 96
26 100
27 1
28 1
29 108
30 112
31 1
32 1
33 136
34 1
35 148
36 1
37 156
38 1
39 1
40 172
41 1
42 180
43 1
44 192
45 196
46 1
47 1
48 1
49 1
50 228
51 232
52 1
53 240
54 1
55 256
56 1
57 268
58 1
59 276
60 280
61 1
62 292
63 1
64 1
65 312
66 316
67 1
68 336
69 1
70 348
71 352
72 1
73 1
74 372
75 1

List of values

[1, 1, 4, 1, 1, 12, 16, 1, 1, 28, 1, 36, 40, 1, 1, 52, 1, 60, 1, 1, 72, 1, 1, 88, 96, 100, 1, 1, 108, 112, 1, 1, 136, 1, 148, 1, 156, 1, 1, 172, 1, 180, 1, 192, 196, 1, 1, 1, 1, 228, 232, 1, 240, 1, 256, 1, 268, 1, 276, 280, 1, 292, 1, 1, 312, 316, 1, 336, 1, 348, 352, 1, 1, 372, 1]