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.

A325690 Number of length-3 integer partitions of n whose largest part is not the sum of the other two.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 2
6 2
7 4
8 3
9 7
10 6
11 10
12 9
13 14
14 13
15 19
16 17
17 24
18 23
19 30
20 28
21 37
22 35
23 44
24 42
25 52
26 50
27 61
28 58
29 70
30 68
31 80
32 77
33 91
34 88
35 102
36 99
37 114
38 111
39 127
40 123
41 140
42 137
43 154
44 150
45 169
46 165
47 184
48 180
49 200
50 196
51 217
52 212
53 234
54 230
55 252
56 247
57 271
58 266
59 290
60 285
61 310

List of values

[0, 0, 0, 1, 0, 2, 2, 4, 3, 7, 6, 10, 9, 14, 13, 19, 17, 24, 23, 30, 28, 37, 35, 44, 42, 52, 50, 61, 58, 70, 68, 80, 77, 91, 88, 102, 99, 114, 111, 127, 123, 140, 137, 154, 150, 169, 165, 184, 180, 200, 196, 217, 212, 234, 230, 252, 247, 271, 266, 290, 285, 310]