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.

A380739 For n = 2^k (k>=0), a(n) = n. Otherwise a(n) != n is the smallest number not yet in the sequence having the same binary weight as n and such that gcd(n,a(n)) > 1.

Table of values

n a(n)
1 1
2 2
3 6
4 4
5 10
6 3
7 14
8 8
9 12
10 5
11 22
12 9
13 26
14 7
15 27
16 16
17 34
18 20
19 38
20 18
21 28
22 11
23 46
24 33
25 35
26 13
27 15
28 21
29 58
30 39
31 62
32 32
33 24
34 17
35 25
36 40
37 74
38 19
39 30
40 36
41 82
42 44
43 86
44 42
45 51
46 23
47 94
48 66
49 56
50 52
51 45
52 50
53 106
54 57
55 110
56 49
57 54
58 29
59 118
60 75
61 122
62 31
63 111
64 64
65 80
66 48
67 134

List of values

[1, 2, 6, 4, 10, 3, 14, 8, 12, 5, 22, 9, 26, 7, 27, 16, 34, 20, 38, 18, 28, 11, 46, 33, 35, 13, 15, 21, 58, 39, 62, 32, 24, 17, 25, 40, 74, 19, 30, 36, 82, 44, 86, 42, 51, 23, 94, 66, 56, 52, 45, 50, 106, 57, 110, 49, 54, 29, 118, 75, 122, 31, 111, 64, 80, 48, 134]