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.

A205129 Least k such that n divides a difference between distinct hexagonal numbers, ordered as in A205128.

Table of values

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

List of values

[1, 2, 3, 7, 1, 9, 2, 29, 3, 9, 5, 12, 6, 2, 9, 121, 10, 16, 14, 12, 15, 5, 20, 48, 21, 54, 4, 52, 28, 9, 35, 497, 36, 90, 24, 33, 45, 14, 8, 71, 55, 61, 65, 7, 16, 20, 77, 138, 30, 82, 13, 63, 91, 27, 51, 71, 23, 252, 119, 12]