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.

A330290 a(1) = 1; for n > 1, a(n) = the smallest divisor of the number formed by the concatenation of a(1) to a(n-1) that has not previously appeared in the sequence.

Table of values

n a(n)
1 1
2 1
3 11
4 101
5 3
6 9
7 7
8 61
9 1821477701
10 311
11 449
12 89
13 29
14 37
15 121
16 349
17 1047
18 73
19 2741
20 59
21 5527
22 21
23 487
24 3679724250117316595527
25 137
26 257
27 33
28 99
29 27
30 47
31 17
32 19
33 13
34 39
35 63
36 23
37 557
38 53
39 159
40 117
41 351
42 81
43 3439913
44 677
45 83
46 197
47 151
48 453
49 211
50 1033
51 239296537198126662281
52 167
53 501

List of values

[1, 1, 11, 101, 3, 9, 7, 61, 1821477701, 311, 449, 89, 29, 37, 121, 349, 1047, 73, 2741, 59, 5527, 21, 487, 3679724250117316595527, 137, 257, 33, 99, 27, 47, 17, 19, 13, 39, 63, 23, 557, 53, 159, 117, 351, 81, 3439913, 677, 83, 197, 151, 453, 211, 1033, 239296537198126662281, 167, 501]