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.

A079023 Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).

Table of values

n a(n)
1 1
2 2
3 6
4 9
5 14
6 24
7 11
8 56
9 46
10 45
11 46
12 109
13 82
14 97
15 287
16 124
17 51
18 390
19 507
20 434
21 691
22 332
23 1105
24 898
25 676
26 359
27 1080
28 1259
29 659
30 1688
31 540
32 1146
33 4081
34 1672
35 3081
36 985
37 3975
38 2423
39 4460
40 6512
41 2779
42 10324
43 1820
44 5458
45 10273
46 8196
47 9177
48 7085
49 6462
50 5037

List of values

[1, 2, 6, 9, 14, 24, 11, 56, 46, 45, 46, 109, 82, 97, 287, 124, 51, 390, 507, 434, 691, 332, 1105, 898, 676, 359, 1080, 1259, 659, 1688, 540, 1146, 4081, 1672, 3081, 985, 3975, 2423, 4460, 6512, 2779, 10324, 1820, 5458, 10273, 8196, 9177, 7085, 6462, 5037]