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.

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

Table of values

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

List of values

[1, 2, 2, 3, 3, 4, 3, 4, 4, 4, 5, 4, 4, 5, 4, 5, 5, 7, 5, 5, 7, 5, 5, 5, 6, 5, 5, 5, 7, 6, 5, 5, 6, 5, 6, 7, 6, 6, 5, 6, 5, 10, 6, 8, 5, 7, 6, 6, 6, 7, 6, 6, 11, 5, 7, 6, 6, 9, 7, 7, 5, 6, 7, 6, 9, 6, 7, 7, 6, 7, 8, 5, 7, 7, 7, 5, 7, 8, 7, 7, 6, 13, 6, 11, 6, 8, 6, 7, 6, 9, 6, 7, 8, 6, 7, 5, 8, 7, 7, 7, 7, 6, 8]