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.

A373696 a(n) is the least m >= 0 with the same number of digits as n such that for some permutation p of 0..9, applying p to the digits of n yields the digits of m.

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10]

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

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