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.

A241019 a(n) is the smallest j such that the n-digit number consisting of a 1 in position j and 3's in the other n-1 positions is a prime, or 0 if no such prime exists.

Table of values

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

List of values

[1, 2, 3, 2, 2, 4, 2, 6, 5, 5, 5, 0, 3, 8, 1, 11, 7, 6, 4, 5, 11, 5, 0, 0, 9, 11, 0, 5, 5, 0, 4, 5, 17, 19, 19, 6, 0, 3, 9, 35, 1, 27, 24, 32, 0, 36, 14, 11, 34, 14, 22, 0, 17, 53, 0, 47, 11, 0, 16, 3, 0, 15, 0, 39, 22, 40, 27, 39, 0, 19, 2, 19, 48, 2, 43, 19]