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.

A132462 Number of partitions of n into distinct parts congruent to 0 or 2 modulo 3.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 2
6 1
7 1
8 3
9 2
10 2
11 5
12 2
13 4
14 7
15 4
16 7
17 10
18 6
19 11
20 14
21 9
22 17
23 19
24 14
25 25
26 26
27 21
28 36
29 35
30 31
31 50
32 47
33 45
34 69
35 63
36 64
37 93
38 84
39 89
40 125
41 111
42 124
43 165
44 147
45 169
46 216
47 194
48 227
49 281
50 254
51 303
52 363
53 332
54 400
55 466
56 432
57 523
58 595
59 559
60 680
61 756
62 721
63 876
64 956
65 926
66 1121

List of values

[1, 0, 1, 1, 0, 2, 1, 1, 3, 2, 2, 5, 2, 4, 7, 4, 7, 10, 6, 11, 14, 9, 17, 19, 14, 25, 26, 21, 36, 35, 31, 50, 47, 45, 69, 63, 64, 93, 84, 89, 125, 111, 124, 165, 147, 169, 216, 194, 227, 281, 254, 303, 363, 332, 400, 466, 432, 523, 595, 559, 680, 756, 721, 876, 956, 926, 1121]