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.

A383766 a(n) is the number of numbers k (0 <= k < n) such that there exist solutions of x^3 + x == y^2 + 1 == k (mod n).

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 3, 1, 4, 2, 3, 2, 6, 3, 4, 2, 5, 4, 7, 2, 6, 3, 8, 2, 10, 6, 11, 3, 12, 4, 11, 4, 6, 5, 6, 4, 13, 7, 12, 2, 11, 6, 16, 3, 8, 8, 13, 4, 21, 10, 10, 6, 17, 11, 6, 3, 14, 12, 18, 4, 20, 11, 12, 8, 12, 6, 27, 5, 16, 6, 26, 4, 27, 13, 20, 7, 9, 12, 26, 4, 31, 11, 25]