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.

A248580 a(n) = the smallest triangular number T(k) such that n*T(k)-1 and n*T(k)+1 are twin primes or 0 if no solution exists for n; T(k) = A000217(k) = k-th triangular number.

Table of values

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

List of values

[6, 3, 6, 1, 6, 1, 6, 0, 0, 3, 78, 1, 66, 3, 10, 15, 6, 1, 78, 3, 300, 21, 6, 3, 6, 78, 10, 15, 210, 1, 378, 6, 6, 3, 66, 3, 1596, 6, 28, 6, 528, 1, 990, 15, 6, 3, 6, 66, 78, 3, 28, 6, 120, 15, 210, 105, 10, 6, 528, 1, 378, 21, 36, 3, 36, 3, 66, 15, 28, 6]