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.

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

Table of values

n a(n)
0 2
1 0
2 25
3 50
4 65
5 94
6 90
7 110
8 155
9 126
10 191
11 170
12 186
13 174
14 190
15 211
16 195
17 226
18 210
19 231
20 234
21 235
22 332
23 255
24 283
25 259
26 274
27 275
28 270
29 323
30 310
31 286
32 306
33 299
34 330
35 381
36 295
37 347
38 334
39 319
40 315
41 331
42 405
43 339
44 335
45 364
46 359
47 351
48 367
49 387
50 371
51 370
52 404
53 438

List of values

[2, 0, 25, 50, 65, 94, 90, 110, 155, 126, 191, 170, 186, 174, 190, 211, 195, 226, 210, 231, 234, 235, 332, 255, 283, 259, 274, 275, 270, 323, 310, 286, 306, 299, 330, 381, 295, 347, 334, 319, 315, 331, 405, 339, 335, 364, 359, 351, 367, 387, 371, 370, 404, 438]

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

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