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.

A363094 Number of partitions of n whose least part is a multiple of 3.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 2
7 1
8 1
9 3
10 2
11 3
12 6
13 6
14 7
15 11
16 11
17 14
18 21
19 24
20 29
21 38
22 44
23 54
24 69
25 81
26 98
27 123
28 144
29 174
30 213
31 253
32 300
33 363
34 427
35 508
36 608
37 716
38 846
39 1004
40 1176
41 1384
42 1631
43 1908
44 2230
45 2616
46 3046
47 3553
48 4143
49 4813
50 5586
51 6492
52 7509
53 8693
54 10057
55 11608
56 13383
57 15435
58 17753
59 20418
60 23463
61 26923
62 30864

List of values

[0, 0, 1, 0, 0, 2, 1, 1, 3, 2, 3, 6, 6, 7, 11, 11, 14, 21, 24, 29, 38, 44, 54, 69, 81, 98, 123, 144, 174, 213, 253, 300, 363, 427, 508, 608, 716, 846, 1004, 1176, 1384, 1631, 1908, 2230, 2616, 3046, 3553, 4143, 4813, 5586, 6492, 7509, 8693, 10057, 11608, 13383, 15435, 17753, 20418, 23463, 26923, 30864]