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.

A354468 Number of possible ordered pairs (n_1, S) where (n_1, n_2, ..., n_k) is a partition of n, n_1 is the largest element of the partition, and S = Sum_{j=1..k} n_j^2.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 7
6 11
7 15
8 22
9 29
10 39
11 50
12 66
13 83
14 104
15 127
16 157
17 188
18 225
19 265
20 312
21 359
22 418
23 479
24 547
25 620
26 700
27 786
28 884
29 987
30 1094
31 1214
32 1348
33 1479
34 1627
35 1779
36 1945
37 2122
38 2313
39 2505
40 2719
41 2934
42 3161
43 3412
44 3666
45 3932
46 4218
47 4511
48 4820
49 5140
50 5477
51 5825

List of values

[1, 1, 2, 3, 5, 7, 11, 15, 22, 29, 39, 50, 66, 83, 104, 127, 157, 188, 225, 265, 312, 359, 418, 479, 547, 620, 700, 786, 884, 987, 1094, 1214, 1348, 1479, 1627, 1779, 1945, 2122, 2313, 2505, 2719, 2934, 3161, 3412, 3666, 3932, 4218, 4511, 4820, 5140, 5477, 5825]