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.

A109885 Let n be an even integer > 2. Let PrimeP be the number of prime partition pairs {p,q} corresponding to n such that n = p + q, p and q are prime and p <= q. Let CompP be the number of composite partition pairs {r,s} corresponding to n such that n = r + s, r is prime, s is composite and r <= s. For what n's is 2*PrimeP > CompP?

Table of values

n a(n)
1 4
2 10
3 22
4 24
5 34
6 36
7 48
8 54
9 60
10 66
11 72
12 78
13 84
14 90
15 102
16 114
17 120
18 126
19 144
20 150
21 156
22 168
23 180
24 186
25 198
26 204
27 210
28 240
29 246
30 252
31 270
32 294
33 300
34 324
35 330
36 360
37 378
38 390
39 420
40 450
41 462
42 480
43 510
44 540
45 546
46 570
47 600
48 630
49 660
50 690
51 714
52 720
53 750
54 780
55 840

List of values

[4, 10, 22, 24, 34, 36, 48, 54, 60, 66, 72, 78, 84, 90, 102, 114, 120, 126, 144, 150, 156, 168, 180, 186, 198, 204, 210, 240, 246, 252, 270, 294, 300, 324, 330, 360, 378, 390, 420, 450, 462, 480, 510, 540, 546, 570, 600, 630, 660, 690, 714, 720, 750, 780, 840]

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

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