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.

A160556 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.

Table of values

n a(n)
1 2
2 8
3 14
4 17
5 26
6 29
7 32
8 38
9 41
10 47
11 50
12 59
13 62
14 64
15 65
16 68
17 74
18 77
19 83
20 89
21 95
22 98
23 101
24 104
25 110
26 119
27 122
28 128
29 131
30 134
31 137
32 140
33 143
34 149
35 152
36 155
37 161
38 164
39 167
40 173
41 179
42 182
43 185
44 188
45 194
46 197
47 200
48 206
49 209
50 212
51 215
52 218
53 221
54 224
55 227
56 230
57 233

List of values

[2, 8, 14, 17, 26, 29, 32, 38, 41, 47, 50, 59, 62, 64, 65, 68, 74, 77, 83, 89, 95, 98, 101, 104, 110, 119, 122, 128, 131, 134, 137, 140, 143, 149, 152, 155, 161, 164, 167, 173, 179, 182, 185, 188, 194, 197, 200, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233]

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

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