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.

A100853 Number of partitions of n in which every part occurs 1, 4, or 5 times. Also number of partitions of n in which every part is congruent to {1, 3, 4, 5, 7} mod 8.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 5
7 7
8 9
9 12
10 15
11 19
12 25
13 31
14 38
15 48
16 59
17 72
18 88
19 107
20 130
21 157
22 188
23 225
24 270
25 321
26 380
27 451
28 533
29 627
30 737
31 864
32 1011
33 1181
34 1375
35 1599
36 1858
37 2152
38 2488
39 2875
40 3316
41 3816
42 4387
43 5036
44 5773
45 6610
46 7555
47 8626
48 9840
49 11207
50 12748
51 14489

List of values

[1, 1, 1, 2, 3, 4, 5, 7, 9, 12, 15, 19, 25, 31, 38, 48, 59, 72, 88, 107, 130, 157, 188, 225, 270, 321, 380, 451, 533, 627, 737, 864, 1011, 1181, 1375, 1599, 1858, 2152, 2488, 2875, 3316, 3816, 4387, 5036, 5773, 6610, 7555, 8626, 9840, 11207, 12748, 14489]