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.

A035382 Number of partitions of n into parts congruent to 1 mod 3.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 2
7 3
8 4
9 4
10 5
11 6
12 7
13 8
14 10
15 11
16 13
17 15
18 17
19 19
20 23
21 26
22 29
23 33
24 38
25 42
26 48
27 54
28 61
29 68
30 77
31 85
32 96
33 107
34 119
35 132
36 148
37 163
38 181
39 201
40 223
41 245
42 272
43 299
44 330
45 363
46 400
47 438
48 483
49 529
50 580
51 635
52 697
53 760
54 832
55 908
56 992
57 1081
58 1180
59 1283
60 1399
61 1521

List of values

[1, 1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 19, 23, 26, 29, 33, 38, 42, 48, 54, 61, 68, 77, 85, 96, 107, 119, 132, 148, 163, 181, 201, 223, 245, 272, 299, 330, 363, 400, 438, 483, 529, 580, 635, 697, 760, 832, 908, 992, 1081, 1180, 1283, 1399, 1521]