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.

A343750 Let S be the set of all numbers that can be obtained by permuting the digits of n (leading zeros can be omitted). Then a(n) is that element of S with the smallest number of divisors. In case of a tie, choose the smallest.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 1
11 11
12 21
13 13
14 41
15 15
16 61
17 17
18 81
19 19
20 2
21 21
22 22
23 23
24 24
25 25
26 26
27 27
28 82
29 29
30 3
31 13
32 23
33 33
34 43
35 53
36 63
37 37
38 83
39 39
40 4
41 41
42 24
43 43
44 44
45 45
46 46
47 47
48 48
49 49
50 5
51 15
52 25
53 53
54 45
55 55
56 65
57 57
58 58
59 59
60 6
61 61
62 26
63 63
64 46
65 65

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 21, 13, 41, 15, 61, 17, 81, 19, 2, 21, 22, 23, 24, 25, 26, 27, 82, 29, 3, 13, 23, 33, 43, 53, 63, 37, 83, 39, 4, 41, 24, 43, 44, 45, 46, 47, 48, 49, 5, 15, 25, 53, 45, 55, 65, 57, 58, 59, 6, 61, 26, 63, 46, 65]