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.

A205378 Least k such that n divides s(k)-s(j) for some j where s(j)=(2j-1)^2.

Table of values

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

List of values

[2, 2, 3, 2, 4, 3, 5, 2, 5, 4, 7, 3, 8, 5, 6, 3, 10, 5, 11, 4, 7, 7, 13, 3, 8, 8, 8, 5, 16, 6, 17, 5, 9, 10, 9, 5, 20, 11, 10, 4, 22, 7, 23, 7, 10, 13, 25, 4, 11, 8, 12, 8, 28, 8, 11, 5, 13, 16, 31, 6]