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.

A363225 Number of integer partitions of n containing three parts (a,b,c) (repeats allowed) such that a + b = c. A variation of sum-full partitions.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 2
6 4
7 5
8 9
9 14
10 21
11 29
12 43
13 58
14 81
15 109
16 148
17 195
18 263
19 339
20 445
21 574
22 744
23 942
24 1209
25 1515
26 1923
27 2399
28 3005
29 3721
30 4629
31 5693
32 7024
33 8589
34 10530
35 12804
36 15596
37 18876
38 22870
39 27538
40 33204
41 39816
42 47766
43 57061
44 68161
45 81099
46 96510
47 114434
48 135634

List of values

[0, 0, 0, 1, 1, 2, 4, 5, 9, 14, 21, 29, 43, 58, 81, 109, 148, 195, 263, 339, 445, 574, 744, 942, 1209, 1515, 1923, 2399, 3005, 3721, 4629, 5693, 7024, 8589, 10530, 12804, 15596, 18876, 22870, 27538, 33204, 39816, 47766, 57061, 68161, 81099, 96510, 114434, 135634]