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.

A102442 Number of iterations needed to transform n by A102440 into a 3-smooth number.

Table of values

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

List of values

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