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.

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

Table of values

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

List of values

[1, 1, 1, 0, 2, -2, 1, 0, 4, 2, -2, -5, 0, -2, 6, 2, 8, -8, -2, 4, -8, 2, 8, 4, -6, -1, 0, 8, -4, -2, -4, 4, 0, 4, 6, -4, -8, -4, 12, 2, 14, -10, 6, -10, 3, 0, -10, 4, 8, -4, 4, 12, -14, 10, -1, 12, 10, -6, -8, -8, -2, 6, 0, 8, -12, 2, -10, -14, 8, 0, -4, 20, 2, -4, -4, 12, 10, -14, -7, -8]