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.

A281938 a(n) is the least k such that gcd(A006666(k), A006667(k)) = n.

Table of values

n a(n)
1 2
2 4
3 8
4 16
5 32
6 64
7 128
8 256
9 512
10 82
11 129
12 4096
13 327
14 16384
15 32768
16 1249
17 35655
18 159
19 4926
20 283
21 377
22 502
23 603
24 799
25 1063
26 1417
27 1889
28 2518
29 3356
30 4472
31 5960
32 7944
33 10594
34 14124
35 18833
36 25110
37 33481
38 44641
39 59521
40 79361
41 105814
42 141084
43 188113
44 250817
45 334422

List of values

[2, 4, 8, 16, 32, 64, 128, 256, 512, 82, 129, 4096, 327, 16384, 32768, 1249, 35655, 159, 4926, 283, 377, 502, 603, 799, 1063, 1417, 1889, 2518, 3356, 4472, 5960, 7944, 10594, 14124, 18833, 25110, 33481, 44641, 59521, 79361, 105814, 141084, 188113, 250817, 334422]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.