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.

A109579 Sum([pi(j+1)-pi(j)][prime(j+1)-prime(j)],j=1..n), where pi(k) is the number of prime numbers less than or equal to k and prime(k) is the k-th prime.

Table of values

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

List of values

[1, 3, 3, 7, 7, 11, 11, 11, 11, 13, 13, 17, 17, 17, 17, 23, 23, 29, 29, 29, 29, 33, 33, 33, 33, 33, 33, 35, 35, 49, 49, 49, 49, 49, 49, 55, 55, 55, 55, 61, 61, 71, 71, 71, 71, 83, 83, 83, 83, 83, 83, 85, 85, 85, 85, 85, 85, 91, 91, 93, 93, 93, 93, 93, 93, 107, 107, 107, 107, 111]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.