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.

A270172 Number of steps required to reach a single-digit number when successively increasing all digits of n by 1 simultaneously and removing leading zeros (9 becomes 0).

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2]