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.

A109852 a(1)=1; a(2) = 2; for n >= 1 and 1 <= k < 2^n, a(2^n+k) is the least multiple of a(2^n-k) not included earlier and a(2^n) is the least number not included earlier.

Table of values

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

List of values

[1, 2, 3, 4, 6, 8, 5, 7, 10, 16, 12, 20, 9, 14, 11, 13, 22, 28, 18, 40, 24, 32, 30, 21, 15, 48, 36, 44, 27, 26, 17, 19, 34, 52, 54, 88, 72, 96, 45, 42, 60, 64, 120, 80, 90, 56, 66, 39, 33, 70, 63, 100, 84, 112, 50, 35, 25, 104, 78, 68, 51, 38, 23, 29, 46, 76, 102, 136, 156, 208]