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.

A178932 Partitions into distinct parts where no subset of the summands is an arithmetic progression (of length 3 or more).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 6
9 6
10 9
11 11
12 11
13 15
14 19
15 18
16 26
17 29
18 32
19 38
20 48
21 47
22 62
23 68
24 79
25 89
26 108
27 110
28 135
29 152
30 166
31 191
32 223
33 237
34 275
35 306
36 345
37 380
38 429
39 472
40 537
41 588
42 650
43 721
44 808
45 902
46 972
47 1083
48 1205
49 1316
50 1450
51 1617
52 1742
53 1919
54 2130
55 2312
56 2531

List of values

[1, 1, 1, 2, 2, 3, 3, 5, 6, 6, 9, 11, 11, 15, 19, 18, 26, 29, 32, 38, 48, 47, 62, 68, 79, 89, 108, 110, 135, 152, 166, 191, 223, 237, 275, 306, 345, 380, 429, 472, 537, 588, 650, 721, 808, 902, 972, 1083, 1205, 1316, 1450, 1617, 1742, 1919, 2130, 2312, 2531]