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.

A099756 For each single digit {0,1,...,9} record the smallest prime made up of copies of that digit (if there is one); repeat for all of the C(10,2) = 45 pairs of distinct decimal digits; then for all triples; etc.

Table of values

n a(n)
1 11
2 2
3 3
4 5
5 7
6 101
7 211
8 13
9 41
10 151
11 61
12 17
13 181
14 19
15 23
16 227
17 29
18 43
19 53
20 37
21 83
22 47
23 449
24 557
25 59
26 67
27 787
28 79
29 89
30 1021
31 103
32 401
33 1051
34 601
35 107
36 1801
37 109
38 2003
39 2027
40 2029
41 4003
42 503
43 307
44 3083
45 4007
46 409
47 5077
48 509
49 607
50 8087
51 709
52 809
53 1123
54 241
55 251
56 1621

List of values

[11, 2, 3, 5, 7, 101, 211, 13, 41, 151, 61, 17, 181, 19, 23, 227, 29, 43, 53, 37, 83, 47, 449, 557, 59, 67, 787, 79, 89, 1021, 103, 401, 1051, 601, 107, 1801, 109, 2003, 2027, 2029, 4003, 503, 307, 3083, 4007, 409, 5077, 509, 607, 8087, 709, 809, 1123, 241, 251, 1621]