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.

A086146 a(n) is the smallest k>=n such that the number of partitions of k is a multiple of n, or -1 if no such k exists.

Table of values

n a(n)
1 1
2 2
3 3
4 11
5 7
6 9
7 10
8 11
9 14
10 19
11 12
12 21
13 28
14 19
15 24
16 66
17 54
18 21
19 20
20 58
21 24
22 25
23 32
24 70
25 44
26 28
27 39
28 55
29 91
30 97
31 44
32 66
33 35
34 94
35 39
36 80
37 86
38 47
39 129
40 66
41 45
42 75
43 100
44 58
45 129
46 75
47 56
48 70
49 68
50 74
51 178
52 62
53 66
54 340
55 58
56 75
57 209
58 97
59 93
60 124
61 115
62 101
63 138
64 66
65 84
66 75
67 111
68 94

List of values

[1, 2, 3, 11, 7, 9, 10, 11, 14, 19, 12, 21, 28, 19, 24, 66, 54, 21, 20, 58, 24, 25, 32, 70, 44, 28, 39, 55, 91, 97, 44, 66, 35, 94, 39, 80, 86, 47, 129, 66, 45, 75, 100, 58, 129, 75, 56, 70, 68, 74, 178, 62, 66, 340, 58, 75, 209, 97, 93, 124, 115, 101, 138, 66, 84, 75, 111, 94]