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.

A336682 a(n) is the number of iterations needed to reach a fixed point starting with n and repeatedly applying f(x) = x - (the product of the digits of x).

Table of values

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

List of values

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