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.

A335824 Persistence of the 1-shifted Sloane's problem: number of iterations of "multiply together all the digits of a number (in base 10) shifted by +1" needed to reach a fixed point or a cycle.

Table of values

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

List of values

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