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.

A329181 a(n) = n if n is 1 or prime; otherwise (1) let m = (concatenation of the two divisors in the middle of rows of A027750(n)), (2) if m is prime then a(n) = m, otherwise return to (1) with n=m.

Table of values

n a(n)
1 1
2 2
3 3
4 211
5 5
6 23
7 7
8 223
9 311
10 773
11 11
12 21179
13 13
14 313
15 1129
16 3137
17 17
18 3449
19 19
20 59
21 37
22 211
23 23
24 223
25 773
26 3251
27 313
28 47
29 29
30 613
31 31
32 4373
33 311
34 21179
35 1129
36 3449
37 37
38 373
39 313
40 229
41 41
42 67
43 43
44 3137
45 59
46 223
47 47
48 4373
49 131321
50 33391
51 317
52 2333
53 53

List of values

[1, 2, 3, 211, 5, 23, 7, 223, 311, 773, 11, 21179, 13, 313, 1129, 3137, 17, 3449, 19, 59, 37, 211, 23, 223, 773, 3251, 313, 47, 29, 613, 31, 4373, 311, 21179, 1129, 3449, 37, 373, 313, 229, 41, 67, 43, 3137, 59, 223, 47, 4373, 131321, 33391, 317, 2333, 53]