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.

A205402 Least k such that n divides s(k)-s(j) for some j < k, where s(j) = floor((j+1)^2/2)/2 (quarter-squares).

Table of values

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

List of values

[2, 3, 3, 4, 4, 6, 5, 5, 8, 6, 6, 7, 9, 7, 7, 8, 11, 8, 8, 11, 9, 12, 9, 9, 14, 10, 11, 10, 10, 11, 14, 11, 12, 11, 11, 12, 13, 12, 15, 12, 12, 16, 13, 14, 13, 20, 13, 13, 19, 14, 17, 14, 20, 14, 14, 16, 21, 15, 25, 15, 17, 15, 15, 19, 17, 16, 28, 16, 17, 16, 16, 17, 26]