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.

A205149 The number s(j) such that n divides s(k)-s(j), where s(j)=prime(j)*prime(j+1) and k is the least positive integer for which such a j exists.

Table of values

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

List of values

[6, 15, 6, 15, 15, 35, 35, 15, 6, 15, 77, 35, 143, 35, 143, 15, 221, 35, 323, 15, 35, 77, 437, 77, 667, 143, 35, 15, 6, 143, 15, 15, 77, 221, 6, 35, 1147, 323, 143, 77, 77, 35, 6, 15, 143, 437, 6, 77, 143, 667, 221, 15, 2491, 35, 1147, 1147, 323, 667, 77]