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.

A052495 Take n-th prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P if r exists; otherwise a(n) = 0.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 18
7 54
8 0
9 0
10 0
11 18
12 36
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 54
21 36
22 18
23 0
24 0
25 18
26 0
27 0
28 594
29 0
30 18
31 144
32 180
33 36
34 54
35 270
36 0
37 414
38 450
39 450
40 144
41 18
42 630
43 720
44 54
45 522
46 720
47 0
48 0
49 0
50 0
51 0
52 54
53 180
54 270
55 0
56 0
57 0
58 144
59 450
60 540
61 540
62 54
63 0
64 180
65 18
66 144
67 18
68 36
69 396
70 90
71 0
72 234

List of values

[0, 0, 0, 0, 0, 18, 54, 0, 0, 0, 18, 36, 0, 0, 0, 0, 0, 0, 0, 54, 36, 18, 0, 0, 18, 0, 0, 594, 0, 18, 144, 180, 36, 54, 270, 0, 414, 450, 450, 144, 18, 630, 720, 54, 522, 720, 0, 0, 0, 0, 0, 54, 180, 270, 0, 0, 0, 144, 450, 540, 540, 54, 0, 180, 18, 144, 18, 36, 396, 90, 0, 234]