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.

A248144 Least positive integer m such that m + n divides p(m*n), where p(.) is the partition function given by A000041.

Table of values

n a(n)
1 4
2 5
3 3
4 1
5 2
6 14
7 2
8 10
9 1
10 4
11 17
12 5
13 9
14 1
15 1
16 6
17 4
18 10
19 16
20 357
21 1
22 197
23 14
24 1
25 3
26 9
27 6
28 1123
29 15
30 93
31 4
32 1
33 8
34 46
35 77
36 99
37 18
38 53
39 10
40 76
41 4
42 2
43 15
44 152
45 4
46 3
47 10
48 29
49 6
50 12
51 4
52 1
53 25
54 1
55 252
56 64
57 106
58 11
59 11
60 136

List of values

[4, 5, 3, 1, 2, 14, 2, 10, 1, 4, 17, 5, 9, 1, 1, 6, 4, 10, 16, 357, 1, 197, 14, 1, 3, 9, 6, 1123, 15, 93, 4, 1, 8, 46, 77, 99, 18, 53, 10, 76, 4, 2, 15, 152, 4, 3, 10, 29, 6, 12, 4, 1, 25, 1, 252, 64, 106, 11, 11, 136]