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.

A342382 a(0) = 0; for n > 0, a(n) is the least positive integer not occurring earlier such that both the digits in a(n) and the digits in a(n-1)*a(n) are all distinct.

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 12
12 13
13 14
14 15
15 16
16 19
17 18
18 17
19 20
20 21
21 23
22 26
23 24
24 27
25 25
26 29
27 28
28 30
29 31
30 34
31 37
32 35
33 36
34 38
35 39
36 32
37 40
38 41
39 43
40 42
41 45
42 48
43 52
44 49
45 50
46 47
47 51
48 46
49 53
50 56
51 54
52 57
53 60
54 58
55 62
56 59
57 68
58 64
59 61
60 65
61 63
62 72
63 69
64 67
65 70
66 71
67 73
68 74
69 76
70 78
71 80
72 79
73 82
74 75
75 81
76 83

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 19, 18, 17, 20, 21, 23, 26, 24, 27, 25, 29, 28, 30, 31, 34, 37, 35, 36, 38, 39, 32, 40, 41, 43, 42, 45, 48, 52, 49, 50, 47, 51, 46, 53, 56, 54, 57, 60, 58, 62, 59, 68, 64, 61, 65, 63, 72, 69, 67, 70, 71, 73, 74, 76, 78, 80, 79, 82, 75, 81, 83]