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.

A205017 Least k such that n divides the k-th difference between distinct oblong numbers.

Table of values

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

List of values

[1, 1, 3, 1, 2, 3, 5, 6, 4, 2, 14, 8, 20, 5, 13, 28, 35, 4, 44, 11, 26, 14, 65, 8, 17, 20, 16, 7, 104, 13, 119, 120, 23, 35, 22, 12, 170, 44, 31, 11, 209, 26, 230, 18, 40, 65, 275, 34, 39, 17, 50, 25, 350, 16, 74, 49, 61, 104, 434, 24]