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.

A248143 Least integer m > 0 such that m + n divides p(m) + p(n), where p(.) is the partition function given by A000041.

Table of values

n a(n)
1 1
2 1
3 1
4 61
5 13
6 7
7 1
8 25
9 109
10 41
11 60
12 1
13 5
14 24
15 18
16 6
17 3
18 7
19 38
20 12
21 86
22 31
23 18
24 14
25 8
26 96
27 470
28 2
29 37
30 245
31 8
32 6
33 37
34 2
35 20
36 137
37 3
38 19
39 24
40 63
41 10
42 99
43 52
44 32
45 16
46 638
47 15
48 20
49 61
50 45
51 288
52 43
53 52
54 12
55 371
56 123
57 94
58 8
59 483
60 11

List of values

[1, 1, 1, 61, 13, 7, 1, 25, 109, 41, 60, 1, 5, 24, 18, 6, 3, 7, 38, 12, 86, 31, 18, 14, 8, 96, 470, 2, 37, 245, 8, 6, 37, 2, 20, 137, 3, 19, 24, 63, 10, 99, 52, 32, 16, 638, 15, 20, 61, 45, 288, 43, 52, 12, 371, 123, 94, 8, 483, 11]