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.

A309668 a(n) is the least positive number of the form floor(2^k/n) for some k >= 0 not yet in the sequence.

Table of values

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

List of values

[1, 2, 5, 4, 3, 10, 9, 8, 7, 6, 11, 21, 19, 18, 17, 16, 15, 14, 13, 12, 24, 23, 22, 42, 20, 39, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 52, 25, 49, 48, 47, 46, 45, 44, 43, 85, 41, 40, 80, 78, 38, 75, 74, 73, 71, 70, 69, 68, 67, 66, 65, 64, 63, 62, 61]