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.

A380481 Number of partitions of n into distinct parts less than n and not a multiple of 3.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 0
5 1
6 2
7 2
8 2
9 3
10 3
11 4
12 6
13 6
14 7
15 9
16 9
17 11
18 14
19 15
20 17
21 20
22 22
23 25
24 30
25 33
26 37
27 42
28 46
29 52
30 60
31 66
32 73
33 82
34 90
35 101
36 114
37 125
38 138
39 153
40 168
41 186
42 207
43 227
44 249
45 274
46 300
47 330
48 364
49 398
50 435
51 476
52 519
53 568
54 622
55 678
56 738
57 804
58 874
59 952
60 1038
61 1127
62 1223
63 1327
64 1438
65 1561
66 1694
67 1834
68 1984
69 2146
70 2320
71 2509
72 2714
73 2930
74 3161

List of values

[1, 0, 0, 1, 0, 1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 9, 9, 11, 14, 15, 17, 20, 22, 25, 30, 33, 37, 42, 46, 52, 60, 66, 73, 82, 90, 101, 114, 125, 138, 153, 168, 186, 207, 227, 249, 274, 300, 330, 364, 398, 435, 476, 519, 568, 622, 678, 738, 804, 874, 952, 1038, 1127, 1223, 1327, 1438, 1561, 1694, 1834, 1984, 2146, 2320, 2509, 2714, 2930, 3161]