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.

A266405 Start with a(1) = 1, then always choose for a(n) the least unused number such that A002487(a(n)*a(n-1)) = A002487(a(n)) * A002487(a(n-1)), where A002487 is Stern-Brocot sequence.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 6
9 9
10 10
11 14
12 16
13 11
14 17
15 13
16 12
17 18
18 15
19 26
20 24
21 23
22 19
23 32
24 20
25 28
26 34
27 22
28 27
29 33
30 29
31 31
32 25
33 45
34 49
35 36
36 30
37 52
38 48
39 35
40 64
41 21
42 69
43 42
44 128
45 37
46 256
47 38
48 46
49 66
50 54
51 41
52 83
53 82
54 108
55 44
56 39
57 88
58 68
59 56
60 40
61 55
62 65
63 47
64 130
65 59
66 96
67 51
68 192
69 70
70 72
71 60
72 104
73 71
74 80
75 57
76 63
77 61
78 126
79 98
80 90
81 50
82 62
83 58
84 124
85 100
86 121
87 127

List of values

[1, 2, 3, 4, 5, 7, 8, 6, 9, 10, 14, 16, 11, 17, 13, 12, 18, 15, 26, 24, 23, 19, 32, 20, 28, 34, 22, 27, 33, 29, 31, 25, 45, 49, 36, 30, 52, 48, 35, 64, 21, 69, 42, 128, 37, 256, 38, 46, 66, 54, 41, 83, 82, 108, 44, 39, 88, 68, 56, 40, 55, 65, 47, 130, 59, 96, 51, 192, 70, 72, 60, 104, 71, 80, 57, 63, 61, 126, 98, 90, 50, 62, 58, 124, 100, 121, 127]