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.

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

Table of values

n a(n)
1 2
2 2
3 3
4 4
5 3
6 5
7 4
8 8
9 4
10 6
11 6
12 5
13 7
14 5
15 6
16 16
17 9
18 6
19 10
20 6
21 8
22 7
23 12
24 9
25 7
26 8
27 7
28 11
29 15
30 8
31 16
32 32
33 8
34 10
35 8
36 12
37 19
38 11
39 9
40 10
41 21
42 9
43 22
44 9
45 10
46 13
47 24
48 17
49 10
50 12
51 11
52 10
53 27
54 10
55 13
56 11
57 12
58 16
59 30
60 11
61 31
62 17
63 11
64 64
65 11
66 17
67 34
68 12
69 14
70 13
71 36
72 12
73 37
74 20
75 12
76 13
77 12
78 18
79 40
80 18
81 13
82 22
83 42
84 14
85 13
86 23
87 17
88 13
89 45
90 13
91 16
92 15

List of values

[2, 2, 3, 4, 3, 5, 4, 8, 4, 6, 6, 5, 7, 5, 6, 16, 9, 6, 10, 6, 8, 7, 12, 9, 7, 8, 7, 11, 15, 8, 16, 32, 8, 10, 8, 12, 19, 11, 9, 10, 21, 9, 22, 9, 10, 13, 24, 17, 10, 12, 11, 10, 27, 10, 13, 11, 12, 16, 30, 11, 31, 17, 11, 64, 11, 17, 34, 12, 14, 13, 36, 12, 37, 20, 12, 13, 12, 18, 40, 18, 13, 22, 42, 14, 13, 23, 17, 13, 45, 13, 16, 15]