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.

A097758 Greatest integer that can be written as a sum of distinct squares in exactly n ways, or -1 if no such number exists.

Table of values

n a(n)
0 128
1 132
2 188
3 192
4 193
5 213
6 228
7 224
8 253
9 288
10 257
11 293
12 297
13 292
14 317
15 301
16 333
17 284
18 337
19 357
20 353
21 329
22 332
23 349
24 336
25 373
26 397
27 362
28 393
29 372
30 377
31 413
32 368
33 365
34 388
35 389
36 417
37 437
38 433
39 319
40 343
41 421
42 405
43 457
44 453
45 364
46 408
47 351
48 432
49 402
50 473

List of values

[128, 132, 188, 192, 193, 213, 228, 224, 253, 288, 257, 293, 297, 292, 317, 301, 333, 284, 337, 357, 353, 329, 332, 349, 336, 373, 397, 362, 393, 372, 377, 413, 368, 365, 388, 389, 417, 437, 433, 319, 343, 421, 405, 457, 453, 364, 408, 351, 432, 402, 473]