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.

A338807 Numbers k such that the process starting at (k, 0) mapping (k, t) to (k+1, t+k) if t = 0 (mod k), and (k-1, t+k) otherwise, eventually reaches (1, T) for some T.

Table of values

n a(n)
1 1
2 2
3 8
4 9
5 11
6 14
7 18
8 20
9 23
10 32
11 35
12 38
13 40
14 47
15 49
16 50
17 53
18 56
19 57
20 58
21 59
22 62
23 67
24 71
25 73
26 74
27 77
28 89
29 91
30 92
31 95
32 98
33 101
34 104
35 106
36 114
37 116
38 128
39 134
40 135
41 137
42 140
43 148
44 149
45 152
46 155
47 156
48 158
49 159
50 162
51 164
52 169
53 172
54 173
55 185
56 188
57 191
58 194
59 197

List of values

[1, 2, 8, 9, 11, 14, 18, 20, 23, 32, 35, 38, 40, 47, 49, 50, 53, 56, 57, 58, 59, 62, 67, 71, 73, 74, 77, 89, 91, 92, 95, 98, 101, 104, 106, 114, 116, 128, 134, 135, 137, 140, 148, 149, 152, 155, 156, 158, 159, 162, 164, 169, 172, 173, 185, 188, 191, 194, 197]