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.

A254073 Number of solutions to x^3 + y^3 + z^3 == 1 (mod n) for 1 <= x, y, z <= n.

Table of values

n a(n)
1 1
2 4
3 9
4 16
5 25
6 36
7 90
8 64
9 162
10 100
11 121
12 144
13 252
14 360
15 225
16 256
17 289
18 648
19 468
20 400
21 810
22 484
23 529
24 576
25 625
26 1008
27 1458
28 1440
29 841
30 900
31 1143
32 1024
33 1089
34 1156
35 2250
36 2592
37 1602
38 1872
39 2268
40 1600
41 1681
42 3240
43 2115
44 1936
45 4050
46 2116
47 2209
48 2304
49 4410

List of values

[1, 4, 9, 16, 25, 36, 90, 64, 162, 100, 121, 144, 252, 360, 225, 256, 289, 648, 468, 400, 810, 484, 529, 576, 625, 1008, 1458, 1440, 841, 900, 1143, 1024, 1089, 1156, 2250, 2592, 1602, 1872, 2268, 1600, 1681, 3240, 2115, 1936, 4050, 2116, 2209, 2304, 4410]