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.

A305211 a(n) is the number of possible values of (x^3 + y^3) mod n, where x and y are any integers.

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 5, 8, 5, 10, 11, 12, 13, 10, 15, 16, 17, 10, 19, 20, 15, 22, 23, 24, 25, 26, 15, 20, 29, 30, 31, 32, 33, 34, 25, 20, 37, 38, 39, 40, 41, 30, 43, 44, 25, 46, 47, 48, 35, 50, 51, 52, 53, 30, 55, 40, 57, 58, 59, 60, 61, 62, 25, 64, 65, 66, 67]

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

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