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.

A363513 a(1) = 2, then a(n) is the least prime p > a(n - 1) such that p + a(n-1) and p - a(n-1) have the same number of prime factors counted with multiplicity.

Table of values

n a(n)
1 2
2 5
3 13
4 31
5 61
6 103
7 157
8 173
9 181
10 193
11 211
12 223
13 239
14 269
15 313
16 337
17 353
18 419
19 487
20 499
21 577
22 613
23 631
24 647
25 677
26 709
27 727
28 827
29 857
30 947
31 1039
32 1093
33 1117
34 1231
35 1283
36 1303
37 1319
38 1483
39 1499
40 1553
41 1609
42 1627
43 1657
44 1693
45 1721
46 1733
47 1823
48 1913
49 1933
50 1951
51 2003
52 2027
53 2039
54 2129
55 2161
56 2203

List of values

[2, 5, 13, 31, 61, 103, 157, 173, 181, 193, 211, 223, 239, 269, 313, 337, 353, 419, 487, 499, 577, 613, 631, 647, 677, 709, 727, 827, 857, 947, 1039, 1093, 1117, 1231, 1283, 1303, 1319, 1483, 1499, 1553, 1609, 1627, 1657, 1693, 1721, 1733, 1823, 1913, 1933, 1951, 2003, 2027, 2039, 2129, 2161, 2203]