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.

A205380 Least s(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 9
2 9
3 25
4 9
5 49
6 25
7 81
8 9
9 81
10 49
11 169
12 25
13 225
14 81
15 121
16 25
17 361
18 81
19 441
20 49
21 169
22 169
23 625
24 25
25 225
26 225
27 225
28 81
29 961
30 121
31 1089
32 81
33 289
34 361
35 289
36 81
37 1521
38 441
39 361
40 49
41 1849
42 169
43 2025
44 169
45 361
46 625
47 2401
48 49
49 441
50 225
51 529
52 225
53 3025
54 225

List of values

[9, 9, 25, 9, 49, 25, 81, 9, 81, 49, 169, 25, 225, 81, 121, 25, 361, 81, 441, 49, 169, 169, 625, 25, 225, 225, 225, 81, 961, 121, 1089, 81, 289, 361, 289, 81, 1521, 441, 361, 49, 1849, 169, 2025, 169, 361, 625, 2401, 49, 441, 225, 529, 225, 3025, 225]