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.

A328458 Maximum run-length of the nontrivial divisors (greater than 1 and less than n) of n.

Table of values

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

List of values

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