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.

A145339 a(n) = the minimum of d(p(n)-1) and d(p(n)+1), where d(m) is the number of divisors of m and p(n) is the n-th prime.

Table of values

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

List of values

[1, 2, 3, 4, 4, 4, 5, 6, 4, 6, 6, 4, 8, 6, 4, 6, 4, 4, 6, 8, 4, 8, 4, 8, 6, 8, 8, 4, 8, 8, 8, 8, 8, 8, 6, 8, 4, 6, 4, 6, 4, 8, 8, 4, 9, 12, 6, 8, 4, 8, 8, 8, 6, 8, 8, 4, 6, 10, 4, 8, 6, 6, 12, 8, 4, 6, 6, 6, 4, 12, 8, 4, 8, 8, 12, 4, 6, 4, 8, 8, 8, 4, 8, 8, 8, 8, 14, 4, 12, 10, 4, 4, 8, 12, 8, 4, 6, 12, 6, 4, 6]