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.

A325695 Number of length-3 strict integer partitions of n such that the largest part is not the sum of the other two.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 3
10 2
11 5
12 5
13 8
14 7
15 12
16 11
17 16
18 15
19 21
20 20
21 27
22 25
23 33
24 32
25 40
26 38
27 48
28 46
29 56
30 54
31 65
32 63
33 75
34 72
35 85
36 83
37 96
38 93
39 108
40 105
41 120
42 117
43 133
44 130
45 147
46 143
47 161
48 158
49 176
50 172
51 192
52 188
53 208
54 204
55 225
56 221
57 243
58 238
59 261
60 257
61 280
62 275

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 2, 5, 5, 8, 7, 12, 11, 16, 15, 21, 20, 27, 25, 33, 32, 40, 38, 48, 46, 56, 54, 65, 63, 75, 72, 85, 83, 96, 93, 108, 105, 120, 117, 133, 130, 147, 143, 161, 158, 176, 172, 192, 188, 208, 204, 225, 221, 243, 238, 261, 257, 280, 275]