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.

A374214 a(n) is the minimum value of A347381 obtained among all proper divisors of n larger than 1, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940). By convention a(1) = a(p) = 0 for all primes p.

Table of values

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

List of values

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