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.

A238433 Number of partitions of n avoiding equidistant 3-term arithmetic progressions.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 5
6 6
7 8
8 13
9 12
10 19
11 23
12 29
13 35
14 45
15 52
16 68
17 80
18 98
19 111
20 141
21 163
22 198
23 230
24 283
25 320
26 376
27 443
28 517
29 585
30 719
31 799
32 932
33 1085
34 1254
35 1417
36 1668
37 1861
38 2138
39 2449
40 2804
41 3166
42 3666
43 4083
44 4662
45 5277
46 5960
47 6676
48 7651
49 8494
50 9635
51 10803
52 12157

List of values

[1, 1, 2, 2, 4, 5, 6, 8, 13, 12, 19, 23, 29, 35, 45, 52, 68, 80, 98, 111, 141, 163, 198, 230, 283, 320, 376, 443, 517, 585, 719, 799, 932, 1085, 1254, 1417, 1668, 1861, 2138, 2449, 2804, 3166, 3666, 4083, 4662, 5277, 5960, 6676, 7651, 8494, 9635, 10803, 12157]