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.

A364405 Numbers k such that k is never the smallest number which requires the maximum number of steps for the Euclidean algorithm for computing gcd(k,m) for any m > k.

Table of values

n a(n)
1 12
2 16
3 20
4 24
5 38
6 46
7 48
8 50
9 54
10 56
11 66
12 70
13 78
14 81
15 84
16 88
17 91
18 96
19 98
20 99
21 100
22 104
23 116
24 122
25 126
26 130
27 132
28 135
29 138
30 141
31 148
32 150
33 155
34 156
35 161
36 162
37 164
38 166
39 168
40 176
41 180
42 182
43 193
44 196
45 200
46 201
47 204
48 205
49 210
50 212
51 214
52 218
53 220
54 228
55 232
56 234
57 236

List of values

[12, 16, 20, 24, 38, 46, 48, 50, 54, 56, 66, 70, 78, 81, 84, 88, 91, 96, 98, 99, 100, 104, 116, 122, 126, 130, 132, 135, 138, 141, 148, 150, 155, 156, 161, 162, 164, 166, 168, 176, 180, 182, 193, 196, 200, 201, 204, 205, 210, 212, 214, 218, 220, 228, 232, 234, 236]