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.

A205141 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(3*j-1) and k is the least positive integer for which such a j exists.

Table of values

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

List of values

[1, 1, 1, 1, 12, 5, 5, 35, 1, 12, 1, 22, 22, 22, 5, 35, 5, 1, 51, 12, 1, 70, 12, 22, 1, 117, 1, 5, 22, 5, 145, 651, 51, 1, 35, 1, 210, 287, 12, 12, 51, 92, 287, 22, 22, 5, 70, 22, 51, 1, 145, 70, 92, 5, 35, 5, 35, 12, 117, 210]