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.

A276435 Smallest integer z > 1 that satisfies all the integer congruences z mod i = b(i) mod i, where b(i) is the i-th composite between prime(k) and prime(k+1), 0 < i < prime(k+1) - prime(k) - 1, and k > 1 is the smallest integer not used by previous terms of the sequence.

Table of values

n a(n)
1 23
2 31
3 47
4 53
5 13
6 23
7 89
8 113
9 11
10 139
11 31
12 37
13 47
14 53
15 181
16 199
17 211
18 53
19 241
20 11
21 17
22 23
23 31
24 283
25 293
26 317
27 31
28 337
29 53
30 359
31 7
32 13
33 23
34 389
35 401
36 409
37 421
38 13
39 23
40 29
41 467
42 59
43 71
44 23
45 509
46 523
47 547
48 17
49 23
50 31
51 577
52 47
53 53
54 7
55 619
56 631
57 47
58 53
59 661
60 17
61 263
62 691
63 281
64 709
65 299
66 7
67 13
68 323

List of values

[23, 31, 47, 53, 13, 23, 89, 113, 11, 139, 31, 37, 47, 53, 181, 199, 211, 53, 241, 11, 17, 23, 31, 283, 293, 317, 31, 337, 53, 359, 7, 13, 23, 389, 401, 409, 421, 13, 23, 29, 467, 59, 71, 23, 509, 523, 547, 17, 23, 31, 577, 47, 53, 7, 619, 631, 47, 53, 661, 17, 263, 691, 281, 709, 299, 7, 13, 323]