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.

A335301 a(n) = prime(n+1) mod (10^k) where k is the least positive integer such that floor(prime(n)/(10^k)) = floor(prime(n+1)/(10^k)) and prime(n) denotes the n-th prime number.

Table of values

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

List of values

[3, 5, 7, 11, 3, 7, 9, 23, 9, 31, 7, 41, 3, 7, 53, 9, 61, 7, 71, 3, 9, 83, 9, 97, 101, 3, 7, 9, 13, 27, 31, 7, 9, 49, 51, 7, 63, 7, 73, 9, 81, 91, 3, 7, 9, 211, 23, 7, 9, 33, 9, 41, 51, 7, 63, 9, 71, 7, 81, 3, 93, 307, 11, 3, 7, 31, 7, 47, 9, 53, 9, 67, 73, 9]