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.

A329264 a(n) is the number of solutions of the infinite Diophantine equation Sum_{j>0} j^r*(k_j)^2 = n with k_j integers and r = 2.

Table of values

n a(n)
0 1
1 2
2 0
3 0
4 4
5 4
6 0
7 0
8 4
9 4
10 4
11 0
12 0
13 12
14 8
15 0
16 6
17 16
18 4
19 0
20 16
21 8
22 8
23 0
24 8
25 24
26 20
27 0
28 0
29 52
30 24
31 0
32 12
33 32
34 28
35 8
36 24
37 12
38 48
39 16
40 24
41 68
42 48
43 8
44 16
45 96
46 32
47 16
48 8
49 68
50 96
51 32
52 40
53 68
54 128
55 32
56 80
57 88
58 76
59 48
60 32
61 156
62 104
63 64
64 8
65 224
66 192
67 40
68 88
69 152
70 208

List of values

[1, 2, 0, 0, 4, 4, 0, 0, 4, 4, 4, 0, 0, 12, 8, 0, 6, 16, 4, 0, 16, 8, 8, 0, 8, 24, 20, 0, 0, 52, 24, 0, 12, 32, 28, 8, 24, 12, 48, 16, 24, 68, 48, 8, 16, 96, 32, 16, 8, 68, 96, 32, 40, 68, 128, 32, 80, 88, 76, 48, 32, 156, 104, 64, 8, 224, 192, 40, 88, 152, 208]