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.

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

Table of values

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

List of values

[1, 5, 3, 11, 5, 17, 3, 7, 13, 3, 37, 9, 3, 7, 21, 11, 5, 67, 7, 9, 7, 19, 9, 33, 5, 3, 11, 5, 17, 15, 131, 9, 3, 21, 3, 13, 35, 7, 13, 19, 5, 15, 65, 5, 3, 19, 15, 35, 5, 9, 7, 17, 11, 257, 7, 13, 3, 21, 9, 3, 37, 19, 7, 9, 5, 75, 17, 11, 5, 33, 7, 15, 21, 11]