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.

A217697 a(n) is the smallest positive integer such that 4n+2 can be partitioned into the sum of two primes in the form of 4k+3 in n ways.

Table of values

n a(n)
1 1
2 3
3 12
4 19
5 28
6 22
7 37
8 61
9 58
10 52
11 67
12 82
13 124
14 112
15 148
16 97
17 175
18 127
19 214
20 172
21 157
22 295
23 280
24 232
25 217
26 328
27 331
28 277
29 247
30 262
31 520
32 337
33 388
34 448
35 430
36 409
37 382
38 442
39 367
40 397
41 610
42 487
43 412
44 535
45 547
46 502
47 592
48 472
49 703
50 766
51 652
52 727
53 637
54 991
55 802

List of values

[1, 3, 12, 19, 28, 22, 37, 61, 58, 52, 67, 82, 124, 112, 148, 97, 175, 127, 214, 172, 157, 295, 280, 232, 217, 328, 331, 277, 247, 262, 520, 337, 388, 448, 430, 409, 382, 442, 367, 397, 610, 487, 412, 535, 547, 502, 592, 472, 703, 766, 652, 727, 637, 991, 802]

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

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