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.

A272197 Number of solutions of the congruence y^2 == x^3 + 1 (mod p) as p runs through the primes.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 11
6 11
7 17
8 11
9 23
10 29
11 35
12 47
13 41
14 35
15 47
16 53
17 59
18 47
19 83
20 71
21 83
22 83
23 83
24 89
25 83
26 101
27 83
28 107
29 107
30 113
31 107
32 131
33 137
34 155
35 149
36 155
37 143
38 155
39 167
40 173
41 179
42 155
43 191
44 191
45 197
46 227
47 227
48 251
49 227
50 251
51 233
52 239
53 227
54 251
55 257
56 263
57 269
58 299
59 251
60 281

List of values

[2, 3, 5, 11, 11, 11, 17, 11, 23, 29, 35, 47, 41, 35, 47, 53, 59, 47, 83, 71, 83, 83, 83, 89, 83, 101, 83, 107, 107, 113, 107, 131, 137, 155, 149, 155, 143, 155, 167, 173, 179, 155, 191, 191, 197, 227, 227, 251, 227, 251, 233, 239, 227, 251, 257, 263, 269, 299, 251, 281]

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

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