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.

A109707 Number of partitions of n into parts each equal to 5 mod 7.

Table of values

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

List of values

[1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 1, 1, 1, 0, 2, 1, 2, 1, 1, 2, 1, 3, 1, 3, 2, 2, 3, 1, 4, 2, 4, 3, 2, 5, 2, 6, 3, 5, 5, 3, 7, 3, 8, 5, 6, 8, 4, 10, 5, 10, 8, 8, 11, 6, 13, 8, 13, 12, 10, 15, 9, 18, 12, 17, 16, 14, 21, 13, 23, 17, 22, 23, 18, 28, 18, 31, 24, 28]