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.

A090180 Primes p = prime(n) such that p + sum-of-digits(p) +- 1 = prime(n+1).

Table of values

n a(n)
1 2
2 3
3 23
4 61
5 131
6 151
7 331
8 601
9 661
10 1013
11 1033
12 1103
13 1123
14 1231
15 1237
16 1259
17 1307
18 1321
19 1811
20 2131
21 2621
22 2861
23 3301
24 4021
25 4159
26 4373
27 4463
28 4733
29 4759
30 4801
31 5059
32 5101
33 6151
34 6229
35 6397
36 6737
37 7079
38 7369
39 7433
40 8191
41 9109
42 10181
43 10691
44 11119

List of values

[2, 3, 23, 61, 131, 151, 331, 601, 661, 1013, 1033, 1103, 1123, 1231, 1237, 1259, 1307, 1321, 1811, 2131, 2621, 2861, 3301, 4021, 4159, 4373, 4463, 4733, 4759, 4801, 5059, 5101, 6151, 6229, 6397, 6737, 7079, 7369, 7433, 8191, 9109, 10181, 10691, 11119]