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.

A346036 Number of swaps needed to return the recursive transform T(k) = concatenate(reverse(k), len(k) + 1) to the tuple 1, 2, ..., n.

Table of values

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

List of values

[0, 0, 1, 2, 2, 4, 5, 4, 6, 8, 7, 10, 10, 10, 13, 12, 12, 14, 17, 16, 18, 18, 17, 22, 22, 20, 25, 24, 24, 28, 29, 24, 26, 32, 31, 34, 32, 32, 35, 38, 36, 40, 35, 40, 40, 40, 39, 44, 46, 42, 49, 50, 44, 52, 51, 52, 52, 54, 51, 54, 58, 56, 59, 54, 54, 64, 61, 60]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.