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.

A054643 Primes prime(n) such that prime(n) + prime(n+1) + prime(n+2) == 0 (mod 3).

Table of values

n a(n)
1 3
2 47
3 151
4 167
5 199
6 251
7 257
8 367
9 503
10 523
11 557
12 587
13 601
14 647
15 727
16 941
17 971
18 991
19 1063
20 1097
21 1117
22 1181
23 1217
24 1231
25 1361
26 1453
27 1493
28 1499
29 1531
30 1741
31 1747
32 1753
33 1759
34 1889
35 1901
36 1907
37 2063
38 2161
39 2281
40 2393
41 2399
42 2411
43 2441
44 2671
45 2897
46 2957

List of values

[3, 47, 151, 167, 199, 251, 257, 367, 503, 523, 557, 587, 601, 647, 727, 941, 971, 991, 1063, 1097, 1117, 1181, 1217, 1231, 1361, 1453, 1493, 1499, 1531, 1741, 1747, 1753, 1759, 1889, 1901, 1907, 2063, 2161, 2281, 2393, 2399, 2411, 2441, 2671, 2897, 2957]