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.

A248713 a(1)=1; starting with n>1, concatenate distinct divisors which are in A050376 in increasing order and repeat until a term of A050376 is reached (a(n)=0 if no term of A050376 is ever reached).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 23
7 7
8 731173
9 9
10 25
11 11
12 31397
13 13
14 313
15 1129
16 16
17 17
18 29
19 19
20 59
21 37
22 211
23 23
24 731173
25 25
26 3251
27 313
28 47
29 29
30 547
31 31
32 313289
33 311
34 31397
35 1129
36 49
37 37
38 373
39 313
40 961
41 41
42 379
43 43
44 3137
45 59
46 223
47 47
48 479
49 49
50 71443
51 317
52 31123
53 53
54 239
55 773

List of values

[1, 2, 3, 4, 5, 23, 7, 731173, 9, 25, 11, 31397, 13, 313, 1129, 16, 17, 29, 19, 59, 37, 211, 23, 731173, 25, 3251, 313, 47, 29, 547, 31, 313289, 311, 31397, 1129, 49, 37, 373, 313, 961, 41, 379, 43, 3137, 59, 223, 47, 479, 49, 71443, 317, 31123, 53, 239, 773]