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.

A364334 a(2) = 0; a(n) = a(n-1) + 1 if n is an odd prime; otherwise a(n) = max{a(k) : k is divisor of n, 1 < k < n}.

Table of values

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

List of values

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