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.

A092130 Number of partitions of n into distinct parts == 1 (mod 3), with 1 as the smallest part.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 1
6 0
7 0
8 1
9 0
10 0
11 1
12 1
13 0
14 1
15 1
16 0
17 1
18 2
19 0
20 1
21 2
22 1
23 1
24 3
25 1
26 1
27 3
28 2
29 1
30 4
31 3
32 1
33 4
34 4
35 2
36 5
37 5
38 2
39 5
40 7
41 3
42 6
43 8
44 4
45 6
46 10
47 6
48 7
49 12
50 7
51 8
52 14
53 10
54 9
55 16
56 12
57 10
58 19
59 16
60 12
61 21
62 19
63 14
64 24
65 24
66 17
67 27
68 28
69 20
70 31
71 35
72 24
73 34
74 40
75 29
76 39
77 48
78 35

List of values

[1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 1, 1, 3, 1, 1, 3, 2, 1, 4, 3, 1, 4, 4, 2, 5, 5, 2, 5, 7, 3, 6, 8, 4, 6, 10, 6, 7, 12, 7, 8, 14, 10, 9, 16, 12, 10, 19, 16, 12, 21, 19, 14, 24, 24, 17, 27, 28, 20, 31, 35, 24, 34, 40, 29, 39, 48, 35]