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.

A351722 a(n) is the number of permutations p of {1, 2, ..., 2*n} such that for any k in 1..2*n, k and p(k) do not share a common 1-bit.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 9
6 9
7 1
8 1
9 121
10 1089
11 729
12 729
13 1521
14 169
15 1
16 1
17 2601
18 314721
19 1771561
20 15944049

List of values

[1, 1, 1, 1, 1, 9, 9, 1, 1, 121, 1089, 729, 729, 1521, 169, 1, 1, 2601, 314721, 1771561, 15944049]