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.

A114091 Number of partitions of n into parts that are distinct mod 3.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 2
6 4
7 3
8 3
9 7
10 4
11 4
12 11
13 5
14 5
15 16
16 6
17 6
18 22
19 7
20 7
21 29
22 8
23 8
24 37
25 9
26 9
27 46
28 10
29 10
30 56
31 11
32 11
33 67
34 12
35 12
36 79
37 13
38 13
39 92
40 14
41 14
42 106
43 15
44 15
45 121
46 16
47 16
48 137
49 17
50 17
51 154
52 18
53 18
54 172
55 19
56 19
57 191
58 20
59 20
60 211
61 21
62 21
63 232
64 22
65 22
66 254
67 23
68 23
69 277
70 24

List of values

[1, 1, 2, 2, 2, 4, 3, 3, 7, 4, 4, 11, 5, 5, 16, 6, 6, 22, 7, 7, 29, 8, 8, 37, 9, 9, 46, 10, 10, 56, 11, 11, 67, 12, 12, 79, 13, 13, 92, 14, 14, 106, 15, 15, 121, 16, 16, 137, 17, 17, 154, 18, 18, 172, 19, 19, 191, 20, 20, 211, 21, 21, 232, 22, 22, 254, 23, 23, 277, 24]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.