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.

A248651 a(n) is the smallest number greater than a(n-1) such that in a(1) through a(n) no digit occurs more than once more than any other digit, starting with a(1) = 1.

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 10
11 20
12 34
13 56
14 78
15 79
16 80
17 91
18 234
19 256
20 301
21 456
22 789
23 790
24 812
25 3456
26 3457
27 6012
28 6089
29 7123
30 8459
31 8460
32 9123
33 9157
34 20345
35 20678
36 31456
37 31789
38 40256
39 40789
40 51236
41 51789
42 60234
43 60789
44 71234
45 71589
46 80234
47 80569
48 91234
49 91567
50 203456
51 203478
52 516789
53 516790
54 518234
55 602347
56 602389
57 714589
58 714590
59 716238
60 802345
61 802369
62 914567
63 914568
64 917023
65 2034567

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 34, 56, 78, 79, 80, 91, 234, 256, 301, 456, 789, 790, 812, 3456, 3457, 6012, 6089, 7123, 8459, 8460, 9123, 9157, 20345, 20678, 31456, 31789, 40256, 40789, 51236, 51789, 60234, 60789, 71234, 71589, 80234, 80569, 91234, 91567, 203456, 203478, 516789, 516790, 518234, 602347, 602389, 714589, 714590, 716238, 802345, 802369, 914567, 914568, 917023, 2034567]