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.

A046641 a(n) is the smallest positive integer m such that the number of partitions p(m) = A000041(m) is divisible by n.

Table of values

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

List of values

[1, 2, 3, 11, 4, 9, 5, 11, 14, 9, 6, 21, 28, 10, 7, 15, 54, 21, 20, 58, 10, 8, 32, 21, 24, 28, 14, 11, 26, 9, 44, 66, 16, 94, 18, 21, 86, 47, 129, 66, 35, 10, 27, 15, 14, 75, 56, 70, 19, 74, 178, 62, 52, 340, 18, 11, 20, 26, 54, 124, 115, 101, 24, 66, 84, 21, 47, 94, 32, 19]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.