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.

A364346 Number of strict integer partitions of n such that there is no ordered triple of parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free strict partitions.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 2
7 4
8 4
9 5
10 5
11 8
12 9
13 11
14 11
15 16
16 16
17 20
18 20
19 25
20 30
21 34
22 38
23 42
24 50
25 58
26 64
27 73
28 80
29 90
30 105
31 114
32 128
33 148
34 158
35 180
36 201
37 220
38 241
39 277
40 306
41 333
42 366
43 404
44 447
45 497
46 544
47 592
48 662
49 708
50 797
51 861
52 954
53 1020
54 1131
55 1226
56 1352
57 1456
58 1600

List of values

[1, 1, 1, 1, 2, 3, 2, 4, 4, 5, 5, 8, 9, 11, 11, 16, 16, 20, 20, 25, 30, 34, 38, 42, 50, 58, 64, 73, 80, 90, 105, 114, 128, 148, 158, 180, 201, 220, 241, 277, 306, 333, 366, 404, 447, 497, 544, 592, 662, 708, 797, 861, 954, 1020, 1131, 1226, 1352, 1456, 1600]