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.

A205133 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2*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 6
4 1
5 1
6 15
7 1
8 1
9 6
10 15
11 6
12 6
13 15
14 1
15 15
16 1
17 28
18 1
19 28
20 6
21 45
22 6
23 45
24 15
25 66
26 153
27 1
28 91
29 91
30 15
31 91
32 1
33 120
34 276
35 15
36 45
37 153
38 28
39 6
40 45
41 190
42 66
43 190
44 1
45 1
46 45
47 231
48 6
49 6
50 28
51 15
52 120
53 325
54 66
55 66
56 45
57 6
58 861
59 378
60 6

List of values

[1, 1, 6, 1, 1, 15, 1, 1, 6, 15, 6, 6, 15, 1, 15, 1, 28, 1, 28, 6, 45, 6, 45, 15, 66, 153, 1, 91, 91, 15, 91, 1, 120, 276, 15, 45, 153, 28, 6, 45, 190, 66, 190, 1, 1, 45, 231, 6, 6, 28, 15, 120, 325, 66, 66, 45, 6, 861, 378, 6]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.