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.

A160557 Positive integers b for which the Diophantine equation f = (b^(2n) - b^n + 8n^2 - 2) / (2n * (2n + 1)) has at least ten solutions for n <= 10000, n is never divisible by 5, and 2n + 1 is prime.

Table of values

n a(n)
1 2
2 32
3 41
4 101
5 161
6 185
7 206
8 215
9 230
10 251
11 290
12 311
13 326
14 335
15 356
16 395
17 416
18 446
19 461
20 521
21 566
22 611
23 626
24 641
25 656
26 740
27 860
28 866
29 926
30 941
31 956
32 965
33 1025
34 1055
35 1076
36 1091
37 1130
38 1151
39 1241
40 1256
41 1271
42 1286
43 1361
44 1370
45 1385
46 1391
47 1436
48 1451
49 1466

List of values

[2, 32, 41, 101, 161, 185, 206, 215, 230, 251, 290, 311, 326, 335, 356, 395, 416, 446, 461, 521, 566, 611, 626, 641, 656, 740, 860, 866, 926, 941, 956, 965, 1025, 1055, 1076, 1091, 1130, 1151, 1241, 1256, 1271, 1286, 1361, 1370, 1385, 1391, 1436, 1451, 1466]