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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 1
6 2
7 2
8 3
9 3
10 4
11 4
12 6
13 5
14 7
15 7
16 9
17 8
18 11
19 10
20 13
21 12
22 15
23 14
24 18
25 16
26 20
27 19
28 23
29 21
30 26
31 24
32 29
33 27
34 32
35 30
36 36
37 33
38 39
39 37
40 43
41 40
42 47
43 44
44 51
45 48
46 55
47 52
48 60
49 56
50 64
51 61
52 69
53 65
54 74
55 70
56 79
57 75
58 84
59 80
60 90
61 85
62 95
63 91
64 101
65 96
66 107
67 102
68 113

List of values

[0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 4, 4, 6, 5, 7, 7, 9, 8, 11, 10, 13, 12, 15, 14, 18, 16, 20, 19, 23, 21, 26, 24, 29, 27, 32, 30, 36, 33, 39, 37, 43, 40, 47, 44, 51, 48, 55, 52, 60, 56, 64, 61, 69, 65, 74, 70, 79, 75, 84, 80, 90, 85, 95, 91, 101, 96, 107, 102, 113]