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.

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

Table of values

n a(n)
1 1
2 2
3 5
4 9
5 10
6 13
7 17
8 18
9 25
10 26
11 29
12 34
13 37
14 41
15 45
16 49
17 50
18 53
19 58
20 61
21 65
22 73
23 74
24 81
25 82
26 85
27 89
28 90
29 97
30 98
31 101
32 106
33 109
34 113
35 117
36 121
37 122
38 125
39 130
40 137
41 145
42 146
43 149
44 153
45 157
46 162
47 169
48 170
49 173
50 178
51 181
52 185
53 193
54 194
55 197
56 202
57 205
58 218
59 221
60 225

List of values

[1, 2, 5, 9, 10, 13, 17, 18, 25, 26, 29, 34, 37, 41, 45, 49, 50, 53, 58, 61, 65, 73, 74, 81, 82, 85, 89, 90, 97, 98, 101, 106, 109, 113, 117, 121, 122, 125, 130, 137, 145, 146, 149, 153, 157, 162, 169, 170, 173, 178, 181, 185, 193, 194, 197, 202, 205, 218, 221, 225]