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.

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

Table of values

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

List of values

[2, 3, 3, 5, 2, 5, 3, 9, 3, 5, 4, 6, 4, 3, 5, 17, 5, 7, 6, 6, 6, 4, 7, 11, 7, 11, 4, 11, 8, 5, 9, 33, 9, 14, 8, 9, 10, 6, 5, 13, 11, 12, 12, 5, 7, 7, 13, 18, 9, 14, 6, 12, 14, 8, 11, 13, 8, 23, 16, 6]