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.

A161294 Number of partitions of n into numbers not divisible by 4 where every part appears at least 3 times.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 2
9 3
10 3
11 3
12 6
13 5
14 6
15 10
16 8
17 9
18 15
19 13
20 16
21 22
22 20
23 24
24 33
25 32
26 36
27 47
28 48
29 53
30 71
31 68
32 77
33 100
34 99
35 112
36 140
37 138
38 158
39 194
40 199
41 219
42 268
43 275
44 305
45 369
46 377
47 416
48 501
49 514
50 572
51 671
52 693
53 768
54 898
55 935
56 1028
57 1189
58 1245
59 1364
60 1576
61 1642
62 1798
63 2063

List of values

[0, 0, 1, 1, 1, 2, 1, 2, 3, 3, 3, 6, 5, 6, 10, 8, 9, 15, 13, 16, 22, 20, 24, 33, 32, 36, 47, 48, 53, 71, 68, 77, 100, 99, 112, 140, 138, 158, 194, 199, 219, 268, 275, 305, 369, 377, 416, 501, 514, 572, 671, 693, 768, 898, 935, 1028, 1189, 1245, 1364, 1576, 1642, 1798, 2063]