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.

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

Table of values

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

List of values

[2, 2, 3, 2, 3, 3, 4, 4, 4, 3, 6, 5, 7, 4, 6, 8, 9, 4, 10, 6, 8, 6, 12, 5, 7, 7, 7, 5, 15, 6, 16, 16, 8, 9, 8, 6, 19, 10, 9, 6, 21, 8, 22, 7, 10, 12, 24, 9, 10, 7, 11, 8, 27, 7, 13, 11, 12, 15, 30, 8]