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.

A115671 Number of partitions of n into parts not congruent to 0, 2, 12, 14, 16, 18, 20, 30 (mod 32).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 6
7 8
8 11
9 15
10 20
11 26
12 34
13 44
14 56
15 72
16 91
17 114
18 143
19 178
20 220
21 272
22 334
23 408
24 498
25 605
26 732
27 884
28 1064
29 1276
30 1528
31 1824
32 2171
33 2580
34 3058
35 3616
36 4269
37 5028
38 5910
39 6936
40 8124
41 9498
42 11088
43 12922
44 15034
45 17468
46 20264
47 23472
48 27154
49 31369

List of values

[1, 1, 1, 2, 3, 4, 6, 8, 11, 15, 20, 26, 34, 44, 56, 72, 91, 114, 143, 178, 220, 272, 334, 408, 498, 605, 732, 884, 1064, 1276, 1528, 1824, 2171, 2580, 3058, 3616, 4269, 5028, 5910, 6936, 8124, 9498, 11088, 12922, 15034, 17468, 20264, 23472, 27154, 31369]