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.

A072511 Least number m such that 2m can be expressed as the sum of two distinct primes in exactly n ways.

Table of values

n a(n)
0 1
1 4
2 8
3 12
4 18
5 24
6 30
7 39
8 42
9 45
10 57
11 72
12 60
13 84
14 90
15 117
16 123
17 144
18 120
19 105
20 162
21 150
22 180
23 237
24 165
25 264
26 288
27 195
28 231
29 240
30 210
31 285
32 255
33 336
34 396
35 378
36 438
37 357
38 399
39 345
40 519
41 315
42 504
43 465
44 390
45 480
46 435
47 462
48 450
49 567
50 717
51 420
52 495
53 651
54 540
55 615

List of values

[1, 4, 8, 12, 18, 24, 30, 39, 42, 45, 57, 72, 60, 84, 90, 117, 123, 144, 120, 105, 162, 150, 180, 237, 165, 264, 288, 195, 231, 240, 210, 285, 255, 336, 396, 378, 438, 357, 399, 345, 519, 315, 504, 465, 390, 480, 435, 462, 450, 567, 717, 420, 495, 651, 540, 615]