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.

A244239 Number of partitions of n into 3 parts such that every i-th smallest part (counted with multiplicity) is different from i.

Table of values

n a(n)
9 1
10 3
11 4
12 6
13 7
14 9
15 11
16 13
17 15
18 18
19 20
20 23
21 26
22 29
23 32
24 36
25 39
26 43
27 47
28 51
29 55
30 60
31 64
32 69
33 74
34 79
35 84
36 90
37 95
38 101
39 107
40 113
41 119
42 126
43 132
44 139
45 146
46 153
47 160
48 168
49 175
50 183
51 191
52 199
53 207
54 216
55 224
56 233
57 242
58 251
59 260
60 270
61 279
62 289
63 299
64 309
65 319
66 330
67 340

List of values

[1, 3, 4, 6, 7, 9, 11, 13, 15, 18, 20, 23, 26, 29, 32, 36, 39, 43, 47, 51, 55, 60, 64, 69, 74, 79, 84, 90, 95, 101, 107, 113, 119, 126, 132, 139, 146, 153, 160, 168, 175, 183, 191, 199, 207, 216, 224, 233, 242, 251, 260, 270, 279, 289, 299, 309, 319, 330, 340]