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.

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

Table of values

n a(n)
1 3
2 5
3 7
4 8
5 10
6 10
7 11
8 12
9 12
10 14
11 14
12 13
13 16
14 14
15 14
16 14
17 16
18 16
19 14
20 20
21 16
22 18
23 16
24 20
25 18
26 17
27 16
28 16
29 20
30 18
31 20
32 20
33 16
34 20
35 18
36 20
37 16
38 16
39 20
40 14
41 22
42 26
43 22
44 18
45 21
46 24
47 22
48 20
49 16
50 20
51 20
52 28
53 26
54 26
55 17
56 20
57 22
58 26
59 16
60 24
61 14
62 18
63 24
64 24
65 20
66 14
67 22
68 26
69 16
70 24
71 20

List of values

[3, 5, 7, 8, 10, 10, 11, 12, 12, 14, 14, 13, 16, 14, 14, 14, 16, 16, 14, 20, 16, 18, 16, 20, 18, 17, 16, 16, 20, 18, 20, 20, 16, 20, 18, 20, 16, 16, 20, 14, 22, 26, 22, 18, 21, 24, 22, 20, 16, 20, 20, 28, 26, 26, 17, 20, 22, 26, 16, 24, 14, 18, 24, 24, 20, 14, 22, 26, 16, 24, 20]