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.

A323835 Start with n and repeatedly double it and apply the "delete multiple digits" map m -> A320485(m); a(n) is the number of steps needed to reach either 0 or 1, or -1 if neither 0 nor 1 is ever reached.

Table of values

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

List of values

[0, 0, 27, 12, 26, 41, 11, 31, 25, 4, 40, 1, 10, 37, 30, 43, 24, 35, 3, 42, 39, 15, 1, 20, 9, 2, 36, 26, 29, 13, 42, 32, 23, 1, 34, 44, 2, 18, 41, 21, 38, 45, 14, 15, 1, 45, 19, 2, 8, 30, 1, 20, 35, 2, 25, 1, 28, 27, 12, 26, 41, 1, 31, 43, 22, 34, 5, 20, 33, 30]