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.

A214834 a(n) is the smallest prime number such that both a(n) and (4n + 2) - a(n) are prime numbers of the form 4k + 3.

Table of values

n a(n)
2 3
3 3
4 3
5 7
6 3
7 3
8 7
9 3
10 7
11 11
12 3
13 3
14 7
15 11
16 3
17 7
18 3
19 3
20 7
21 3
22 3
23 7
24 11
25 19
26 19
27 3
28 3
29 7
30 11
31 19
32 19
33 3
34 3
35 7
36 3
37 7
38 11
39 3
40 7
41 11
42 3
43 3
44 7
45 11
46 3
47 7
48 11
49 3
50 7
51 3
52 7
53 11
54 3
55 7
56 11
57 3
58 3
59 7
60 11
61 3
62 7
63 11
64 3
65 7
66 11
67 3
68 7
69 3
70 7
71 11
72 3
73 7
74 11
75 47
76 19
77 23
78 3
79 3
80 7
81 11

List of values

[3, 3, 3, 7, 3, 3, 7, 3, 7, 11, 3, 3, 7, 11, 3, 7, 3, 3, 7, 3, 3, 7, 11, 19, 19, 3, 3, 7, 11, 19, 19, 3, 3, 7, 3, 7, 11, 3, 7, 11, 3, 3, 7, 11, 3, 7, 11, 3, 7, 3, 7, 11, 3, 7, 11, 3, 3, 7, 11, 3, 7, 11, 3, 7, 11, 3, 7, 3, 7, 11, 3, 7, 11, 47, 19, 23, 3, 3, 7, 11]

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

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