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.

A112687 Numbers n that cannot be decomposed into the sum of at most 4 square numbers when using the following algorithm: Repeat the following 2 steps 4 times: 1-find the largest square s smaller than n; 2-n=n-s Numbers that can be decomposed yield final values of n=0. The sequence presented is of those numbers where n is not 0 when this algorithm ends.

Table of values

n a(n)
1 23
2 32
3 43
4 48
5 56
6 61
7 71
8 76
9 79
10 88
11 93
12 96
13 107
14 112
15 115
16 119
17 128
18 133
19 136
20 140
21 143
22 151
23 156
24 159
25 163
26 166
27 167
28 176
29 181
30 184
31 188
32 191
33 192
34 203
35 208
36 211
37 215
38 218
39 219
40 224
41 232
42 237
43 240
44 244
45 247
46 248
47 253
48 263
49 268
50 271
51 275
52 278
53 279
54 284

List of values

[23, 32, 43, 48, 56, 61, 71, 76, 79, 88, 93, 96, 107, 112, 115, 119, 128, 133, 136, 140, 143, 151, 156, 159, 163, 166, 167, 176, 181, 184, 188, 191, 192, 203, 208, 211, 215, 218, 219, 224, 232, 237, 240, 244, 247, 248, 253, 263, 268, 271, 275, 278, 279, 284]