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.

A338466 a(0) = 0; for n > 0, a(n) is the least positive integer not occurring earlier such that 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 11
13 13
14 14
15 15
16 16
17 19
18 18
19 17
20 20
21 21
22 22
23 23
24 26
25 24
26 27
27 25
28 29
29 28
30 30
31 31
32 33
33 32
34 39
35 34
36 37
37 35
38 36
39 38
40 40
41 41
42 43
43 42
44 45
45 44
46 47
47 50
48 49
49 52
50 48
51 55
52 46
53 51
54 53
55 56
56 54
57 57
58 60
59 58
60 62
61 59
62 66
63 61
64 64
65 63
66 65
67 71
68 70
69 67
70 69
71 68
72 72
73 74
74 73
75 77
76 79

List of values

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