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.

A331103 T(n,k) = -(-1)^k*k^2 mod p, where p is the n-th prime congruent to 2 or 3 mod 4; triangle T(n,k), n>=1, 0<=k<=p-1, read by rows.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 3
9 2
10 5
11 4
12 6
13 0
14 1
15 7
16 9
17 6
18 3
19 8
20 5
21 2
22 4
23 10
24 0
25 1
26 15
27 9
28 3
29 6
30 2
31 11
32 12
33 5
34 14
35 7
36 8
37 17
38 13
39 16
40 10
41 4
42 18
43 0
44 1
45 19
46 9
47 7
48 2
49 10
50 3
51 5
52 12
53 15
54 6
55 17
56 8
57 11
58 18
59 20
60 13
61 21
62 16
63 14
64 4
65 22
66 0
67 1
68 27
69 9
70 15
71 25
72 26
73 18
74 29
75 19
76 24

List of values

[0, 1, 0, 1, 2, 0, 1, 3, 2, 5, 4, 6, 0, 1, 7, 9, 6, 3, 8, 5, 2, 4, 10, 0, 1, 15, 9, 3, 6, 2, 11, 12, 5, 14, 7, 8, 17, 13, 16, 10, 4, 18, 0, 1, 19, 9, 7, 2, 10, 3, 5, 12, 15, 6, 17, 8, 11, 18, 20, 13, 21, 16, 14, 4, 22, 0, 1, 27, 9, 15, 25, 26, 18, 29, 19, 24]