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.

A097759 Number of integers that can be written as a sum of distinct squares in exactly n ways.

Table of values

n a(n)
0 31
1 38
2 25
3 30
4 19
5 14
6 13
7 10
8 17
9 15
10 6
11 11
12 7
13 6
14 10
15 5
16 8
17 6
18 8
19 5
20 7
21 6
22 1
23 4
24 4
25 10
26 3
27 7
28 7
29 3
30 4
31 5
32 3
33 6
34 5
35 2
36 5
37 3
38 2
39 1
40 2
41 8
42 1
43 3
44 5
45 1
46 4
47 1
48 4
49 2
50 4
51 7
52 2
53 2
54 2
55 4
56 1
57 1
58 5
59 1
60 2
61 2
62 5
63 2
64 3
65 2
66 2
67 2
68 0
69 1
70 5
71 2
72 3
73 1
74 1
75 1
76 2
77 2
78 6
79 1
80 4
81 0
82 2
83 1
84 3
85 1
86 3
87 4
88 0
89 2
90 4
91 5
92 1
93 1
94 1
95 0
96 2
97 1

List of values

[31, 38, 25, 30, 19, 14, 13, 10, 17, 15, 6, 11, 7, 6, 10, 5, 8, 6, 8, 5, 7, 6, 1, 4, 4, 10, 3, 7, 7, 3, 4, 5, 3, 6, 5, 2, 5, 3, 2, 1, 2, 8, 1, 3, 5, 1, 4, 1, 4, 2, 4, 7, 2, 2, 2, 4, 1, 1, 5, 1, 2, 2, 5, 2, 3, 2, 2, 2, 0, 1, 5, 2, 3, 1, 1, 1, 2, 2, 6, 1, 4, 0, 2, 1, 3, 1, 3, 4, 0, 2, 4, 5, 1, 1, 1, 0, 2, 1]