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.

A109699 Number of partitions of n into parts each equal to 3 mod 5.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 2, 2, 4, 2, 4, 4, 3, 5, 4, 5, 6, 5, 7, 6, 8, 8, 7, 11, 9, 10, 13, 10, 14, 14, 14, 17, 16, 19, 19, 20, 24, 21, 27, 27, 27, 33, 30, 35, 38, 36, 44, 42, 47, 51, 50, 58, 57, 63, 68, 66, 79, 76, 82, 92, 88, 101, 104, 107, 120]