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.

A205148 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=prime(j)*prime(j+1).

Table of values

n a(n)
1 15
2 35
3 15
4 35
5 35
6 77
7 77
8 143
9 15
10 35
11 143
12 143
13 221
14 77
15 323
16 143
17 323
18 143
19 437
20 35
21 77
22 143
23 667
24 221
25 1517
26 221
27 143
28 323
29 35
30 323
31 77
32 143
33 143
34 323
35 2491
36 143
37 1517
38 437
39 221
40 437
41 323
42 77
43 221
44 323
45 323
46 667
47 899
48 221
49 437
50 1517
51 323
52 899

List of values

[15, 35, 15, 35, 35, 77, 77, 143, 15, 35, 143, 143, 221, 77, 323, 143, 323, 143, 437, 35, 77, 143, 667, 221, 1517, 221, 143, 323, 35, 323, 77, 143, 143, 323, 2491, 143, 1517, 437, 221, 437, 323, 77, 221, 323, 323, 667, 899, 221, 437, 1517, 323, 899]