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.

A213883 Least number k such that (10^k-j)*10^n-1 is prime for some single-digit j or 0 if no such prime with 1<=k, 0<=j<=9 exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 2, 1, 1, 3, 5, 5, 3, 1, 3, 3, 1, 1, 9, 1, 1, 1, 1, 1, 7, 3, 6, 4, 1, 4, 4, 1, 15, 10, 1, 7, 3, 1, 3, 2, 2, 4, 6, 1, 3, 5, 20, 1, 1, 1, 8, 10, 7, 15, 10, 1, 4, 2, 5, 8, 3, 23, 11, 2, 2, 9, 3, 1, 5, 4, 1, 6, 3, 18, 2]