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.

A089395 Prime productive numbers m: Let the digits of m be abcd. Then the numbers bcd*a+1, cd*ab+1, d*abc+1, abcd+1 etc. are all primes. If m is a k-digit number it produces k such primes.

Table of values

n a(n)
0 1
1 2
2 4
3 6
4 12
5 16
6 22
7 28
8 36
9 52
10 58
11 66
12 82
13 106
14 112
15 136
16 166
17 178
18 256
19 306
20 336
21 352
22 448
23 502
24 508
25 556
26 562
27 586
28 616
29 652
30 658
31 718
32 982
33 1018
34 1108
35 1162
36 1192
37 1228
38 1498
39 1708
40 2002
41 2026
42 2086
43 2686
44 2776
45 2998
46 3136
47 3412
48 3526
49 3592
50 4078
51 4918

List of values

[1, 2, 4, 6, 12, 16, 22, 28, 36, 52, 58, 66, 82, 106, 112, 136, 166, 178, 256, 306, 336, 352, 448, 502, 508, 556, 562, 586, 616, 652, 658, 718, 982, 1018, 1108, 1162, 1192, 1228, 1498, 1708, 2002, 2026, 2086, 2686, 2776, 2998, 3136, 3412, 3526, 3592, 4078, 4918]