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.

A263203 Consider the numbers m such that m = prime(k) + prime(k+2i+1) = prime(k+i) + prime(k+i+1) for some i and k. The sequence lists the number of pairs (i,k) giving the same value m = A105093(n).

Table of values

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

List of values

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