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.

A339630 a(n) is the first number k such that there are exactly n ways to write 6*k = p + q with p a lesser twin prime (A001359) and q a greater twin prime (A006512), or 0 if there is no such k.

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 8
5 20
6 19
7 80
8 40
9 90
10 48
11 270
12 35
13 50
14 117
15 140
16 110
17 644
18 215
19 714
20 222
21 430
22 345
23 350
24 315
25 850
26 390
27 930
28 620
29 1110
30 602
31 1040
32 385
33 2290
34 590
35 780
36 798
37 910
38 735
39 990
40 1020
41 1700
42 700
43 770
44 595
45 1760
46 950
47 3380
48 875
49 5660
50 1330
51 1120
52 975
53 5970
54 1085
55 2990
56 1400
57 3980
58 1815
59 4570

List of values

[1, 2, 3, 4, 8, 20, 19, 80, 40, 90, 48, 270, 35, 50, 117, 140, 110, 644, 215, 714, 222, 430, 345, 350, 315, 850, 390, 930, 620, 1110, 602, 1040, 385, 2290, 590, 780, 798, 910, 735, 990, 1020, 1700, 700, 770, 595, 1760, 950, 3380, 875, 5660, 1330, 1120, 975, 5970, 1085, 2990, 1400, 3980, 1815, 4570]