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.

A358318 For n >= 5, a(n) is the number of zeros that need to be inserted to the left of the ones digit of the n-th prime so that the result is composite.

Table of values

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

List of values

[2, 2, 2, 4, 1, 1, 1, 2, 3, 1, 1, 3, 3, 2, 3, 5, 1, 2, 1, 3, 5, 1, 1, 1, 3, 3, 1, 3, 3, 1, 4, 1, 1, 1, 3, 1, 2, 2, 3, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 5, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 6, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 2, 1, 1, 1, 1, 3]