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.

A205031 s(k)-s(j), where (s(k),s(j)) is the least pair of oblong numbers for which n divides their difference.

Table of values

n a(n)
1 4
2 4
3 6
4 4
5 10
6 6
7 14
8 8
9 18
10 10
11 22
12 24
13 26
14 14
15 30
16 16
17 34
18 18
19 38
20 40
21 42
22 22
23 46
24 24
25 50
26 26
27 54
28 28
29 58
30 30
31 62
32 32
33 66
34 34
35 70
36 36
37 74
38 38
39 78
40 40
41 82
42 42
43 86
44 44
45 90
46 46
47 94
48 48
49 98
50 50
51 102
52 52
53 106
54 54
55 110
56 112
57 114
58 58
59 118
60 60

List of values

[4, 4, 6, 4, 10, 6, 14, 8, 18, 10, 22, 24, 26, 14, 30, 16, 34, 18, 38, 40, 42, 22, 46, 24, 50, 26, 54, 28, 58, 30, 62, 32, 66, 34, 70, 36, 74, 38, 78, 40, 82, 42, 86, 44, 90, 46, 94, 48, 98, 50, 102, 52, 106, 54, 110, 112, 114, 58, 118, 60]