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.

A117086 Number of partitions of n such that the largest part is a multiple of the smallest part.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 11
7 12
8 20
9 26
10 37
11 45
12 71
13 84
14 117
15 152
16 203
17 253
18 342
19 421
20 556
21 694
22 884
23 1096
24 1409
25 1729
26 2168
27 2672
28 3327
29 4061
30 5039
31 6114
32 7514
33 9110
34 11098
35 13400
36 16275
37 19537
38 23575
39 28245
40 33929
41 40465
42 48424
43 57552
44 68569
45 81296
46 96449

List of values

[1, 2, 3, 5, 6, 11, 12, 20, 26, 37, 45, 71, 84, 117, 152, 203, 253, 342, 421, 556, 694, 884, 1096, 1409, 1729, 2168, 2672, 3327, 4061, 5039, 6114, 7514, 9110, 11098, 13400, 16275, 19537, 23575, 28245, 33929, 40465, 48424, 57552, 68569, 81296, 96449]