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.

A132463 Number of partitions of n into distinct parts congruent to 0 or 1 modulo 3.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 2
5 1
6 1
7 3
8 2
9 2
10 5
11 4
12 3
13 7
14 7
15 5
16 10
17 11
18 8
19 14
20 17
21 13
22 20
23 25
24 19
25 27
26 36
27 29
28 37
29 50
30 43
31 51
32 69
33 61
34 69
35 94
36 86
37 93
38 126
39 120
40 125
41 167
42 164
43 167
44 220
45 222
46 222
47 287
48 297
49 294
50 373
51 393
52 386
53 481
54 516
55 505
56 617
57 672
58 657
59 788
60 868
61 850
62 1002
63 1114
64 1094

List of values

[1, 1, 0, 1, 2, 1, 1, 3, 2, 2, 5, 4, 3, 7, 7, 5, 10, 11, 8, 14, 17, 13, 20, 25, 19, 27, 36, 29, 37, 50, 43, 51, 69, 61, 69, 94, 86, 93, 126, 120, 125, 167, 164, 167, 220, 222, 222, 287, 297, 294, 373, 393, 386, 481, 516, 505, 617, 672, 657, 788, 868, 850, 1002, 1114, 1094]