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.

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

Table of values

n a(n)
1 6
2 6
3 12
4 6
5 12
6 12
7 20
8 20
9 20
10 12
11 42
12 30
13 56
14 20
15 42
16 72
17 90
18 20
19 110
20 42
21 72
22 42
23 156
24 30
25 56
26 56
27 56
28 30
29 240
30 42
31 272
32 272
33 72
34 90
35 72
36 42
37 380
38 110
39 90
40 42
41 462
42 72
43 506
44 56
45 110
46 156
47 600
48 90
49 110
50 56
51 132
52 72
53 756
54 56
55 182
56 132
57 156
58 240
59 930
60 72

List of values

[6, 6, 12, 6, 12, 12, 20, 20, 20, 12, 42, 30, 56, 20, 42, 72, 90, 20, 110, 42, 72, 42, 156, 30, 56, 56, 56, 30, 240, 42, 272, 272, 72, 90, 72, 42, 380, 110, 90, 42, 462, 72, 506, 56, 110, 156, 600, 90, 110, 56, 132, 72, 756, 56, 182, 132, 156, 240, 930, 72]