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.

A109703 Number of partitions of n into parts each equal to 1 mod 7.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 5, 6, 7, 7, 7, 7, 7, 8, 10, 11, 12, 12, 12, 12, 13, 15, 17, 18, 19, 19, 19, 20, 23, 26, 28, 29, 30, 30, 31, 34, 38, 41, 43, 44, 45, 46, 50, 55, 60, 63, 65, 66, 68, 72, 79, 85, 90, 93, 95, 97, 103, 111, 120, 127, 132, 135]