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.

A109704 Number of partitions of n into parts each equal to 2 mod 7.

Table of values

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

List of values

[1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 3, 1, 3, 2, 3, 3, 3, 4, 3, 4, 4, 4, 6, 4, 7, 4, 8, 5, 8, 7, 8, 9, 8, 10, 9, 11, 12, 11, 15, 11, 17, 12, 18, 15, 19, 19, 19, 22, 20, 24, 24, 25, 29, 26, 34, 27, 37, 31, 39, 38, 40, 44, 42, 49, 47, 52, 55, 54, 64, 56, 71, 62, 76, 72, 79]