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.

A052380 a(n) = D is the smallest distance (D) between 2 non-overlapping prime twins differing by d=2n; these twins are [p,p+d] or [p+D,p+D+d] and p > 3.

Table of values

n a(n)
1 6
2 6
3 6
4 12
5 12
6 12
7 18
8 18
9 18
10 24
11 24
12 24
13 30
14 30
15 30
16 36
17 36
18 36
19 42
20 42
21 42
22 48
23 48
24 48
25 54
26 54
27 54
28 60
29 60
30 60
31 66
32 66
33 66
34 72
35 72
36 72
37 78
38 78
39 78
40 84
41 84
42 84
43 90
44 90
45 90
46 96
47 96
48 96
49 102
50 102
51 102
52 108
53 108
54 108
55 114
56 114
57 114
58 120
59 120
60 120
61 126
62 126
63 126
64 132

List of values

[6, 6, 6, 12, 12, 12, 18, 18, 18, 24, 24, 24, 30, 30, 30, 36, 36, 36, 42, 42, 42, 48, 48, 48, 54, 54, 54, 60, 60, 60, 66, 66, 66, 72, 72, 72, 78, 78, 78, 84, 84, 84, 90, 90, 90, 96, 96, 96, 102, 102, 102, 108, 108, 108, 114, 114, 114, 120, 120, 120, 126, 126, 126, 132]

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

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