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.

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

Table of values

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

List of values

[2, 2, 4, 2, 4, 5, 3, 6, 10, 4, 3, 7, 5, 8, 5, 6, 4, 10, 7, 8, 4, 8, 5, 7, 6, 13, 28, 9, 6, 5, 11, 22, 9, 5, 7, 10, 13, 18, 6, 8, 8, 11, 15, 15, 13, 6, 9, 7, 13, 6, 13, 15, 10, 29, 10, 9, 8, 7, 11, 15]