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.

A370747 Number of partitions of n into distinct parts such that number of parts is a multiples of 3.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 2
9 3
10 4
11 5
12 7
13 8
14 10
15 12
16 14
17 16
18 19
19 21
20 24
21 28
22 31
23 35
24 40
25 45
26 51
27 59
28 66
29 76
30 87
31 100
32 114
33 133
34 151
35 175
36 201
37 232
38 265
39 307
40 349
41 402
42 458
43 524
44 594
45 680
46 767
47 872
48 983
49 1112
50 1248
51 1409
52 1575
53 1770
54 1976
55 2211
56 2460
57 2748
58 3048
59 3393
60 3759
61 4173
62 4612
63 5112

List of values

[1, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 19, 21, 24, 28, 31, 35, 40, 45, 51, 59, 66, 76, 87, 100, 114, 133, 151, 175, 201, 232, 265, 307, 349, 402, 458, 524, 594, 680, 767, 872, 983, 1112, 1248, 1409, 1575, 1770, 1976, 2211, 2460, 2748, 3048, 3393, 3759, 4173, 4612, 5112]