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.

A364533 Number of strict integer partitions of n containing the sum of no pair of distinct parts. A variation of sum-free strict partitions.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 5
9 8
10 7
11 11
12 11
13 15
14 15
15 21
16 22
17 28
18 32
19 38
20 40
21 51
22 55
23 65
24 74
25 83
26 94
27 111
28 119
29 136
30 160
31 174
32 196
33 222
34 252
35 273
36 315
37 341
38 391
39 425
40 477
41 518
42 602
43 636
44 719
45 782
46 886
47 944
48 1073
49 1140
50 1302
51 1380
52 1553
53 1651
54 1888
55 1995
56 2224
57 2370

List of values

[1, 1, 1, 2, 2, 3, 3, 5, 5, 8, 7, 11, 11, 15, 15, 21, 22, 28, 32, 38, 40, 51, 55, 65, 74, 83, 94, 111, 119, 136, 160, 174, 196, 222, 252, 273, 315, 341, 391, 425, 477, 518, 602, 636, 719, 782, 886, 944, 1073, 1140, 1302, 1380, 1553, 1651, 1888, 1995, 2224, 2370]