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.

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

Table of values

n a(n)
1 2
2 2
3 7
4 7
5 15
6 15
7 15
8 15
9 15
10 23
11 39
12 31
13 47
14 47
15 47
16 55
17 63
18 63
19 63
20 79
21 63
22 71
23 79
24 95
25 95
26 119
27 119
28 95
29 111
30 95
31 119
32 127
33 143
34 127
35 135
36 135
37 159
38 175
39 191
40 167
41 191
42 175
43 191
44 191
45 215
46 215
47 191
48 215
49 239
50 207
51 223
52 223
53 223
54 271
55 255
56 255
57 279
58 279
59 303
60 255

List of values

[2, 2, 7, 7, 15, 15, 15, 15, 15, 23, 39, 31, 47, 47, 47, 55, 63, 63, 63, 79, 63, 71, 79, 95, 95, 119, 119, 95, 111, 95, 119, 127, 143, 127, 135, 135, 159, 175, 191, 167, 191, 175, 191, 191, 215, 215, 191, 215, 239, 207, 223, 223, 223, 271, 255, 255, 279, 279, 303, 255]

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

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