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.

A329448 Numbers n which appear twice in the sequence starting with n and subsequent terms given by 10c + d where c is the number of times (> 0) the least frequent digit d has appeared so far, smallest d in case of tie.

Table of values

n a(n)
1 10
2 12
3 13
4 14
5 15
6 16
7 17
8 18
9 19
10 20
11 22
12 23
13 24
14 25
15 26
16 27
17 28
18 29
19 30
20 34
21 35
22 36
23 37
24 38
25 39
26 40
27 44
28 45
29 46
30 47
31 48
32 49
33 50
34 55
35 56
36 57
37 58
38 59
39 60
40 66
41 67
42 68
43 69
44 70
45 77
46 78
47 79
48 80
49 88
50 89
51 90
52 99
53 100
54 102
55 103
56 104
57 105
58 106
59 107
60 108
61 109
62 115
63 122
64 123
65 124
66 125
67 126
68 127
69 128

List of values

[10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 44, 45, 46, 47, 48, 49, 50, 55, 56, 57, 58, 59, 60, 66, 67, 68, 69, 70, 77, 78, 79, 80, 88, 89, 90, 99, 100, 102, 103, 104, 105, 106, 107, 108, 109, 115, 122, 123, 124, 125, 126, 127, 128]