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.

A200065 Start with n, concatenate its trivial divisors, and repeat until a prime is reached. a(n) = 0 if no prime is ever reached.

Table of values

n a(n)
1 0
2 0
3 13
4 0
5 0
6 0
7 17
8 0
9 19
10 0
11 1111111111111111111
12 0
13 113
14 0
15 0
16 0
17 1117
18 0
19 11119
20 0
21 111121
22 0
23 1123
24 0
25 0
26 0
27 127
28 0
29 1129
30 0
31 131
32 0

List of values

[0, 0, 13, 0, 0, 0, 17, 0, 19, 0, 1111111111111111111, 0, 113, 0, 0, 0, 1117, 0, 11119, 0, 111121, 0, 1123, 0, 0, 0, 127, 0, 1129, 0, 131, 0]