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.

A097387 Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.

Table of values

n a(n)
1 60
2 460
3 640
4 820
5 1360
6 1480
7 1620
8 1870
9 2110
10 2380
11 3460
12 3630
13 3880
14 4560
15 4650
16 5640
17 5650
18 5860
19 6210
20 6310
21 6360
22 6420
23 7480
24 8170
25 8680
26 8830
27 11680
28 11830
29 12280
30 12640
31 12820
32 13780
33 14620
34 15460
35 15640
36 15660
37 15880
38 16410
39 16420

List of values

[60, 460, 640, 820, 1360, 1480, 1620, 1870, 2110, 2380, 3460, 3630, 3880, 4560, 4650, 5640, 5650, 5860, 6210, 6310, 6360, 6420, 7480, 8170, 8680, 8830, 11680, 11830, 12280, 12640, 12820, 13780, 14620, 15460, 15640, 15660, 15880, 16410, 16420]