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.

A046712 From the Bruck-Ryser theorem: n == 1 or 2 (mod 4) which are not the sum of 2 squares.

Table of values

n a(n)
1 6
2 14
3 21
4 22
5 30
6 33
7 38
8 42
9 46
10 54
11 57
12 62
13 66
14 69
15 70
16 77
17 78
18 86
19 93
20 94
21 102
22 105
23 110
24 114
25 118
26 126
27 129
28 133
29 134
30 138
31 141
32 142
33 150
34 154
35 158
36 161
37 165
38 166
39 174
40 177
41 182
42 186
43 189
44 190
45 198
46 201
47 206
48 209
49 210
50 213
51 214
52 217
53 222
54 230
55 237
56 238

List of values

[6, 14, 21, 22, 30, 33, 38, 42, 46, 54, 57, 62, 66, 69, 70, 77, 78, 86, 93, 94, 102, 105, 110, 114, 118, 126, 129, 133, 134, 138, 141, 142, 150, 154, 158, 161, 165, 166, 174, 177, 182, 186, 189, 190, 198, 201, 206, 209, 210, 213, 214, 217, 222, 230, 237, 238]