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.

A226241 Primes that cannot be reached from 2 via a chain of primes obtained adding or deleting a digit from the end or the beginning of the previous term of the chain.

Table of values

n a(n)
1 89
2 101
3 103
4 107
5 109
6 151
7 163
8 227
9 251
10 257
11 263
12 269
13 281
14 307
15 389
16 401
17 409
18 457
19 503
20 509
21 521
22 557
23 563
24 569
25 587
26 601
27 607
28 701
29 709
30 809
31 821
32 827
33 857
34 863
35 881
36 887
37 907
38 1009
39 1013
40 1019
41 1021
42 1031
43 1033
44 1039
45 1049
46 1051
47 1061
48 1063
49 1069

List of values

[89, 101, 103, 107, 109, 151, 163, 227, 251, 257, 263, 269, 281, 307, 389, 401, 409, 457, 503, 509, 521, 557, 563, 569, 587, 601, 607, 701, 709, 809, 821, 827, 857, 863, 881, 887, 907, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069]