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.

A108932 Number of partitions of n into parts that are congruent to 1, 5 or 6 mod 8.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 3
7 3
8 3
9 4
10 5
11 6
12 7
13 8
14 10
15 12
16 13
17 15
18 18
19 21
20 24
21 27
22 31
23 36
24 41
25 46
26 52
27 60
28 68
29 76
30 86
31 97
32 109
33 122
34 136
35 153
36 172
37 191
38 212
39 237
40 264
41 293
42 325
43 360
44 400
45 443
46 488
47 539
48 596
49 657
50 723
51 796
52 876
53 963
54 1057
55 1159
56 1272
57 1395
58 1526
59 1669
60 1827

List of values

[1, 1, 1, 1, 1, 2, 3, 3, 3, 4, 5, 6, 7, 8, 10, 12, 13, 15, 18, 21, 24, 27, 31, 36, 41, 46, 52, 60, 68, 76, 86, 97, 109, 122, 136, 153, 172, 191, 212, 237, 264, 293, 325, 360, 400, 443, 488, 539, 596, 657, 723, 796, 876, 963, 1057, 1159, 1272, 1395, 1526, 1669, 1827]