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.

A376691 The number of solutions to x + y == x^2 + y^2 == x^3 + y^3 (mod n) with 0 <= x <= y < n.

Table of values

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

List of values

[1, 3, 3, 5, 3, 10, 3, 7, 5, 10, 3, 16, 3, 10, 10, 7, 3, 18, 3, 16, 10, 10, 3, 24, 7, 10, 5, 16, 3, 36, 3, 11, 10, 10, 10, 28, 3, 10, 10, 24, 3, 36, 3, 16, 18, 10, 3, 24, 9, 26, 10, 16, 3, 18, 10, 24, 10, 10, 3, 56, 3, 10, 18, 11, 10, 36, 3, 16, 10, 36]

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

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