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.

A318578 Let k be the greatest odd divisor of n and let S be the sequence of positive integers not in the sequence so far in increasing order. Then a(n) = S(k).

Table of values

n a(n)
1 1
2 2
3 5
4 3
5 9
6 7
7 13
8 4
9 17
10 12
11 21
12 10
13 25
14 18
15 29
16 6
17 33
18 23
19 37
20 16
21 41
22 28
23 45
24 14
25 49
26 34
27 53
28 24
29 57
30 39
31 61
32 8
33 65
34 44
35 69
36 31
37 73
38 50
39 77
40 22
41 81
42 55
43 85
44 38
45 89
46 60
47 93
48 19
49 97
50 66
51 101
52 46
53 105
54 71
55 109
56 32
57 113
58 76
59 117
60 52
61 121
62 82
63 125
64 11
65 129
66 87
67 133

List of values

[1, 2, 5, 3, 9, 7, 13, 4, 17, 12, 21, 10, 25, 18, 29, 6, 33, 23, 37, 16, 41, 28, 45, 14, 49, 34, 53, 24, 57, 39, 61, 8, 65, 44, 69, 31, 73, 50, 77, 22, 81, 55, 85, 38, 89, 60, 93, 19, 97, 66, 101, 46, 105, 71, 109, 32, 113, 76, 117, 52, 121, 82, 125, 11, 129, 87, 133]