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.

A099268 For each single digit {0,1,...,9} record the smallest prime made up of copies of that digit or 0 if no such prime exists; 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 0
2 11
3 2
4 3
5 0
6 5
7 0
8 7
9 0
10 0
11 101
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 211
21 13
22 41
23 151
24 61
25 17
26 181
27 19
28 23
29 0
30 0
31 0
32 227
33 0
34 29
35 43
36 53
37 0
38 37
39 83
40 0
41 0
42 0
43 47
44 0
45 499
46 0
47 557
48 0
49 59
50 67
51 0
52 0
53 787
54 79
55 89
56 1021
57 103
58 401
59 5101
60 601
61 701
62 8101
63 109
64 2003
65 0
66 0
67 0
68 2027
69 0
70 2029
71 4003
72 503

List of values

[0, 11, 2, 3, 0, 5, 0, 7, 0, 0, 101, 0, 0, 0, 0, 0, 0, 0, 0, 211, 13, 41, 151, 61, 17, 181, 19, 23, 0, 0, 0, 227, 0, 29, 43, 53, 0, 37, 83, 0, 0, 0, 47, 0, 499, 0, 557, 0, 59, 67, 0, 0, 787, 79, 89, 1021, 103, 401, 5101, 601, 701, 8101, 109, 2003, 0, 0, 0, 2027, 0, 2029, 4003, 503]