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.

A109705 Number of partitions of n into parts each equal to 3 mod 7.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 3, 1, 2, 4, 2, 2, 4, 4, 2, 4, 5, 3, 4, 6, 5, 4, 6, 7, 5, 6, 8, 8, 6, 9, 11, 7, 9, 13, 10, 9, 14, 14, 10, 15, 17, 14, 15, 19, 19, 16, 20, 24, 20, 21, 27, 27, 22, 29, 33, 27, 30, 38, 35, 32, 41, 44, 37, 43, 51, 47, 45]