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.

A335766 a(n) is the number of partitions of n into parts congruent to 1, 2, or 4 modulo 6 where only parts congruent to 1 modulo 6 may be repeated.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 3
6 4
7 5
8 6
9 7
10 9
11 10
12 12
13 14
14 18
15 20
16 24
17 27
18 31
19 35
20 41
21 47
22 54
23 61
24 70
25 78
26 90
27 101
28 116
29 129
30 146
31 162
32 182
33 203
34 228
35 254
36 284
37 314
38 351
39 388
40 433
41 478
42 531
43 584
44 646
45 711
46 785
47 863
48 952
49 1044
50 1149
51 1258
52 1384
53 1513
54 1660
55 1812
56 1983
57 2163

List of values

[1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 14, 18, 20, 24, 27, 31, 35, 41, 47, 54, 61, 70, 78, 90, 101, 116, 129, 146, 162, 182, 203, 228, 254, 284, 314, 351, 388, 433, 478, 531, 584, 646, 711, 785, 863, 952, 1044, 1149, 1258, 1384, 1513, 1660, 1812, 1983, 2163]