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.

A265405 Start with a(1) = 1, then always choose for a(n) the least unused number such that A193231(a(n)*a(n-1)) = A193231(a(n)) * A193231(a(n-1)), where A193231 is an involution of natural numbers called Blue code.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 16
8 7
9 17
10 8
11 15
12 32
13 12
14 10
15 18
16 20
17 19
18 256
19 9
20 14
21 34
22 48
23 40
24 50
25 33
26 60
27 257
28 11
29 97
30 258
31 13
32 101
33 209
34 65536
35 21
36 259
37 64
38 30
39 65
40 51
41 80
42 24
43 84
44 36
45 85
46 66
47 260
48 22
49 4352
50 26
51 4368
52 28
53 4369
54 37
55 768
56 41
57 770
58 42
59 771
60 68
61 90
62 272
63 45
64 273
65 56
66 1200
67 952
68 4096
69 23
70 4097
71 27
72 4098
73 86
74 512
75 54

List of values

[1, 2, 3, 4, 5, 6, 16, 7, 17, 8, 15, 32, 12, 10, 18, 20, 19, 256, 9, 14, 34, 48, 40, 50, 33, 60, 257, 11, 97, 258, 13, 101, 209, 65536, 21, 259, 64, 30, 65, 51, 80, 24, 84, 36, 85, 66, 260, 22, 4352, 26, 4368, 28, 4369, 37, 768, 41, 770, 42, 771, 68, 90, 272, 45, 273, 56, 1200, 952, 4096, 23, 4097, 27, 4098, 86, 512, 54]