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.

A205132 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=2*j^2-j, the j-th hexagonal number.

Table of values

n a(n)
1 6
2 15
3 15
4 45
5 6
6 45
7 15
8 153
9 15
10 45
11 28
12 66
13 28
14 15
15 45
16 561
17 45
18 91
19 66
20 66
21 66
22 28
23 91
24 231
25 91
26 231
27 28
28 231
29 120
30 45
31 153
32 2145
33 153
34 378
35 120
36 153
37 190
38 66
39 45
40 325
41 231
42 276
43 276
44 45
45 91
46 91
47 325
48 630
49 153
50 378
51 66
52 276
53 378
54 120
55 231
56 325
57 120

List of values

[6, 15, 15, 45, 6, 45, 15, 153, 15, 45, 28, 66, 28, 15, 45, 561, 45, 91, 66, 66, 66, 28, 91, 231, 91, 231, 28, 231, 120, 45, 153, 2145, 153, 378, 120, 153, 190, 66, 45, 325, 231, 276, 276, 45, 91, 91, 325, 630, 153, 378, 66, 276, 378, 120, 231, 325, 120]