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.

A232210 Let b_k=3...3 consist of k>=1 3's. Then a(n) is the smallest k such that the concatenation prime(n)b_k is prime, or a(n)=0 if there is no such prime.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 1
6 14
7 1
8 1
9 1
10 1
11 1
12 1
13 2
14 1
15 2
16 2
17 1
18 1
19 1
20 3
21 1
22 2
23 6
24 2
25 2
26 1
27 1
28 2
29 1
30 4
31 4
32 23
33 1
34 2
35 1
36 6
37 2
38 2
39 5
40 1
41 10
42 2
43 1
44 1
45 1
46 1
47 1
48 6
49 1
50 1
51 1
52 1
53 2
54 4
55 2
56 1
57 1
58 1
59 2
60 4
61 1
62 2
63 5
64 4
65 2
66 3
67 1
68 1
69 5
70 4
71 1
72 1
73 1
74 1
75 1
76 1
77 2
78 2
79 1
80 1
81 6
82 4
83 2
84 14
85 2
86 4
87 1
88 3

List of values

[1, 0, 1, 1, 1, 14, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 3, 1, 2, 6, 2, 2, 1, 1, 2, 1, 4, 4, 23, 1, 2, 1, 6, 2, 2, 5, 1, 10, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 2, 4, 2, 1, 1, 1, 2, 4, 1, 2, 5, 4, 2, 3, 1, 1, 5, 4, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 6, 4, 2, 14, 2, 4, 1, 3]