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.

A091048 a(n) = the number of steps needed to reach the final value of n via repeated interpretation of n as a base b+1 number where b is the largest digit of n.

Table of values

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

List of values

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