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.

A268491 Array T(n,k) = least integer congruent to prime(i) mod prime(i+1) for all k <= i <= k+n; n, k >= 1; read by upward diagonals.

Table of values

n a(n)
1 2
2 8
3 3
4 68
5 33
6 5
7 1118
8 348
9 40
10 7
11 2273
12 2273
13 271
14 128
15 11
16 197468
17 27298
18 10281
19 557
20 115
21 13
22 1728998
23 112383
24 112383
25 20005
26 3209
27 302
28 17
29 1728998
30 1728998
31 1728998
32 666651
33 87189
34 5470
35 226
36 19
37 447914738
38 447914738
39 16601856
40 16601856
41 2598191

List of values

[2, 8, 3, 68, 33, 5, 1118, 348, 40, 7, 2273, 2273, 271, 128, 11, 197468, 27298, 10281, 557, 115, 13, 1728998, 112383, 112383, 20005, 3209, 302, 17, 1728998, 1728998, 1728998, 666651, 87189, 5470, 226, 19, 447914738, 447914738, 16601856, 16601856, 2598191]