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.

A205140 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=j(3j-1)/2, the j-th pentagonal number.

Table of values

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

List of values

[5, 5, 22, 5, 22, 35, 12, 51, 145, 22, 12, 70, 35, 92, 35, 51, 22, 145, 70, 92, 22, 92, 35, 70, 51, 247, 1162, 117, 51, 35, 176, 715, 117, 35, 70, 145, 247, 477, 51, 92, 92, 176, 330, 330, 247, 51, 117, 70, 247, 51, 247, 330, 145, 1247, 145, 117, 92, 70]