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.

A059940 Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.

Table of values

n a(n)
2 3
3 5
4 31
5 41
6 107
7 11
8 17
9 727
10 499
11 443
12 863
13 439
14 457
15 3373
16 23
17 1637
18 53
19 6857
20 31
21 47
22 5323
23 811
24 6911
25 919
26 29
27 19681
28 439
29 739
30 13499
31 29789
32 43
33 7187
34 43
35 461
36 23327
37 50651
38 59
39 2579
40 2909
41 22973
42 2179
43 15901
44 14197
45 293
46 1187
47 34607
48 11059

List of values

[3, 5, 31, 41, 107, 11, 17, 727, 499, 443, 863, 439, 457, 3373, 23, 1637, 53, 6857, 31, 47, 5323, 811, 6911, 919, 29, 19681, 439, 739, 13499, 29789, 43, 7187, 43, 461, 23327, 50651, 59, 2579, 2909, 22973, 2179, 15901, 14197, 293, 1187, 34607, 11059]