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.

A111477 a(1) = 11, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.

Table of values

n a(n)
1 11
2 19
3 19
4 37
5 21
6 71
7 101
8 39
9 61
10 87
11 227
12 63
13 437
14 153
15 1363
16 117
17 363
18 861
19 609
20 249
21 23
22 1077
23 3123
24 771
25 3717
26 633
27 279
28 1119
29 927
30 107
31 3843
32 4313
33 1729
34 627
35 12541
36 2403
37 4083
38 1239
39 2227
40 6441
41 3819
42 3983
43 5631
44 2303
45 2971
46 19217
47 3633
48 5109
49 14413
50 913

List of values

[11, 19, 19, 37, 21, 71, 101, 39, 61, 87, 227, 63, 437, 153, 1363, 117, 363, 861, 609, 249, 23, 1077, 3123, 771, 3717, 633, 279, 1119, 927, 107, 3843, 4313, 1729, 627, 12541, 2403, 4083, 1239, 2227, 6441, 3819, 3983, 5631, 2303, 2971, 19217, 3633, 5109, 14413, 913]