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.

A329377 Number of iterations done when n is divided by its divisors starting from the smallest one in increasing order until one no longer gets an integer, or until divisors are exhausted.

Table of values

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

List of values

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