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.

A121919 Least m such that partition number of m modulo m (=A093952(m)) is n.

Table of values

n a(n)
0 1
1 4
2 5
3 9
4 74
5 6
6 8
7 16
8 17
9 14
10 13
11 15
12 22
13 23
14 1402
15 19
16 41
17 69
18 26
19 232
20 61
21 617
22 28
23 38
24 30
25 205
26 50
27 196
28 65
29 32
30 175
31 56
32 96
33 381
34 45
35 140
36 57
37 104
38 59
39 51
40 119
41 795
42 262
43 117
44 78
45 88
46 86
47 60
48 106
49 812
50 113
51 63
52 81
53 90
54 229
55 72
56 66
57 209
58 71
59 68
60 352
61 178
62 64
63 354

List of values

[1, 4, 5, 9, 74, 6, 8, 16, 17, 14, 13, 15, 22, 23, 1402, 19, 41, 69, 26, 232, 61, 617, 28, 38, 30, 205, 50, 196, 65, 32, 175, 56, 96, 381, 45, 140, 57, 104, 59, 51, 119, 795, 262, 117, 78, 88, 86, 60, 106, 812, 113, 63, 81, 90, 229, 72, 66, 209, 71, 68, 352, 178, 64, 354]