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.

A320485 Keep just the digits of n that appear exactly once; write -1 if all digits disappear.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 -1
12 12
13 13
14 14
15 15
16 16
17 17
18 18
19 19
20 20
21 21
22 -1
23 23
24 24
25 25
26 26
27 27
28 28
29 29
30 30
31 31
32 32
33 -1
34 34
35 35
36 36
37 37
38 38
39 39
40 40
41 41
42 42
43 43
44 -1
45 45
46 46
47 47
48 48
49 49
50 50
51 51
52 52
53 53
54 54
55 -1
56 56
57 57
58 58
59 59
60 60
61 61
62 62
63 63
64 64
65 65
66 -1
67 67
68 68
69 69
70 70
71 71
72 72
73 73
74 74
75 75
76 76
77 -1
78 78
79 79
80 80
81 81
82 82
83 83
84 84
85 85
86 86
87 87
88 -1
89 89
90 90
91 91
92 92
93 93
94 94
95 95
96 96
97 97
98 98
99 -1
100 1
101 0
102 102
103 103
104 104
105 105
106 106
107 107
108 108
109 109
110 0
111 -1
112 2
113 3
114 4
115 5
116 6
117 7
118 8
119 9
120 120
121 2
122 1
123 123
124 124
125 125
126 126
127 127
128 128
129 129
130 130
131 3

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -1, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, -1, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, -1, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, -1, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, -1, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, -1, 1, 0, 102, 103, 104, 105, 106, 107, 108, 109, 0, -1, 2, 3, 4, 5, 6, 7, 8, 9, 120, 2, 1, 123, 124, 125, 126, 127, 128, 129, 130, 3]