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.

A031349 3-multiplicative persistence: number of iterations of "multiply 3rd powers of digits" needed to reach 0 or 1.

Table of values

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

List of values

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