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.

A035386 Number of partitions of n into parts congruent to 2 mod 3.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 1
7 1
8 2
9 1
10 3
11 2
12 3
13 3
14 4
15 4
16 6
17 5
18 7
19 7
20 9
21 9
22 12
23 11
24 15
25 15
26 18
27 19
28 23
29 23
30 29
31 29
32 35
33 37
34 43
35 45
36 53
37 55
38 64
39 68
40 78
41 82
42 95
43 99
44 114
45 121
46 136
47 145
48 164
49 173
50 196
51 208
52 232
53 248
54 276
55 294
56 328
57 349
58 386
59 413
60 456
61 486
62 537
63 572
64 629
65 673
66 737
67 787

List of values

[1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 3, 2, 3, 3, 4, 4, 6, 5, 7, 7, 9, 9, 12, 11, 15, 15, 18, 19, 23, 23, 29, 29, 35, 37, 43, 45, 53, 55, 64, 68, 78, 82, 95, 99, 114, 121, 136, 145, 164, 173, 196, 208, 232, 248, 276, 294, 328, 349, 386, 413, 456, 486, 537, 572, 629, 673, 737, 787]

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

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