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.

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

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 5
6 12
7 9
8 17
9 30
10 29
11 32
12 79
13 64
14 70
15 236
16 116
17 48
18 342
19 375
20 359
21 633
22 310
23 852
24 846
25 644
26 354
27 1048
28 1191
29 635
30 1664
31 539
32 1127
33 3971
34 1656
35 3022
36 984
37 3894
38 2399
39 4439
40 6431
41 2765
42 10256
43 1818
44 5427
45 10251
46 8153
47 9119
48 7083
49 6456
50 5033

List of values

[1, 2, 3, 5, 5, 12, 9, 17, 30, 29, 32, 79, 64, 70, 236, 116, 48, 342, 375, 359, 633, 310, 852, 846, 644, 354, 1048, 1191, 635, 1664, 539, 1127, 3971, 1656, 3022, 984, 3894, 2399, 4439, 6431, 2765, 10256, 1818, 5427, 10251, 8153, 9119, 7083, 6456, 5033]

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

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