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.

A261098 Row 1 of A261096.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Aug 26 2015

Keywords

Comments

Equally, column 1 of A261097.
Take the n-th (n>=0) permutation from the list A055089 (A195663), change 1 to 2 and 2 to 1 to get another permutation, and note its rank in the same list to obtain a(n).
Self-inverse permutation of nonnegative integers.

Examples

			In A195663 the permutation with rank 12 is [1,3,4,2], and swapping the elements 1 and 2 we get permutation [2,3,4,1], which is listed in A195663 as the permutation with rank 18, thus a(12) = 18.
		

Crossrefs

Row 1 of A261096, column 1 of A261097.
Cf. also A004442.
Related permutations: A060119, A060126, A261218.

Formula

a(n) = A261096(1,n).
By conjugating related permutations:
a(n) = A060119(A261218(A060126(n))).