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.

A244853 Let d(1)d(2)... d(q) denote the decimal expansion of a prime number n > 9. The sequence lists the primes such that replacing each digit d(i) with d(i+1) copies for i = 1..q-1 and d(q) with d(1) copies produces a prime. Zeros are not allowed.

Table of values

n a(n)
1 11
2 17
3 71
4 113
5 131
6 151
7 167
8 181
9 211
10 227
11 281
12 431
13 467
14 521
15 547
16 617
17 743
18 829
19 853
20 883
21 1163
22 1193
23 1733
24 2131
25 2137
26 3121
27 3181
28 3413
29 3457
30 3727
31 4441
32 5351
33 6143
34 6151
35 6473
36 6779
37 6823
38 6977
39 8263
40 8293
41 8423
42 9787
43 11273
44 11321
45 11369
46 11483

List of values

[11, 17, 71, 113, 131, 151, 167, 181, 211, 227, 281, 431, 467, 521, 547, 617, 743, 829, 853, 883, 1163, 1193, 1733, 2131, 2137, 3121, 3181, 3413, 3457, 3727, 4441, 5351, 6143, 6151, 6473, 6779, 6823, 6977, 8263, 8293, 8423, 9787, 11273, 11321, 11369, 11483]