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.

A327450 Number of ways the first n squares can be partitioned into three sets with equal sums.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 1
14 0
15 0
16 0
17 137
18 211
19 0
20 0
21 0
22 3035
23 0
24 0
25 0
26 120465
27 259383
28 0
29 0
30 0
31 12328889
32 0
33 0
34 0
35 673380980
36 1659966694
37 0
38 0
39 0
40 69819104134
41 0
42 0
43 0
44 3761284888715
45 9660240745536
46 0
47 0
48 0
49 537238185892321
50 0
51 0
52 0
53 29922345673502904

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 137, 211, 0, 0, 0, 3035, 0, 0, 0, 120465, 259383, 0, 0, 0, 12328889, 0, 0, 0, 673380980, 1659966694, 0, 0, 0, 69819104134, 0, 0, 0, 3761284888715, 9660240745536, 0, 0, 0, 537238185892321, 0, 0, 0, 29922345673502904]