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.

A364345 Number of integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 5
6 7
7 10
8 13
9 16
10 21
11 27
12 34
13 43
14 54
15 67
16 83
17 102
18 122
19 151
20 182
21 218
22 258
23 313
24 366
25 443
26 513
27 611
28 713
29 844
30 975
31 1149
32 1325
33 1554
34 1780
35 2079
36 2381
37 2761
38 3145
39 3647
40 4134
41 4767
42 5408
43 6200
44 7014
45 8035
46 9048
47 10320
48 11639
49 13207
50 14836
51 16850

List of values

[1, 1, 2, 2, 4, 5, 7, 10, 13, 16, 21, 27, 34, 43, 54, 67, 83, 102, 122, 151, 182, 218, 258, 313, 366, 443, 513, 611, 713, 844, 975, 1149, 1325, 1554, 1780, 2079, 2381, 2761, 3145, 3647, 4134, 4767, 5408, 6200, 7014, 8035, 9048, 10320, 11639, 13207, 14836, 16850]