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.

A257231 a(n) = n^2 mod p where p is the least prime greater than n.

Table of values

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

List of values

[1, 1, 4, 1, 4, 1, 5, 9, 4, 1, 4, 1, 16, 9, 4, 1, 4, 1, 16, 9, 4, 1, 7, 25, 16, 9, 4, 1, 4, 1, 36, 25, 16, 9, 4, 1, 16, 9, 4, 1, 4, 1, 16, 9, 4, 1, 36, 25, 16, 9, 4, 1, 36, 25, 16, 9, 4, 1, 4, 1, 36, 25, 16, 9, 4, 1, 16, 9, 4, 1, 4, 1, 36, 25, 16, 9, 4, 1, 16, 9, 4, 1, 36, 25, 16, 9, 4]