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.

A139140 For n>=1, a(n) = d(prime(n)+1) + d(prime(n)+2) + d(prime(n)+3) + ... + d(prime(n+1)), where d(m) is the number of positive divisors of m and prime(n) is the n-th prime. a(0) = d(1) + d(2).

Table of values

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

List of values

[3, 2, 5, 6, 13, 8, 15, 8, 16, 27, 10, 29, 18, 10, 18, 31, 30, 14, 31, 20, 14, 30, 21, 34, 48, 23, 10, 22, 14, 24, 83, 22, 38, 10, 61, 14, 40, 36, 20, 41, 34, 20, 60, 16, 23, 14, 82, 72, 27, 14, 26, 36, 22, 58, 45, 36, 40, 18, 42, 28, 10, 67, 98, 26, 18, 24, 101, 42, 64, 14, 34]