login
A190389
Number of permutations of 0..(n-1) with equal numbers of bit changes for every bit in the binary representation of the permutation.
0
1, 2, 2, 0, 0, 36, 144, 672, 0, 688, 161420, 1568320, 16640624, 234147048, 2955532608, 39844932096
OFFSET
1,2
EXAMPLE
Some solutions for n=6 (in binary)
..100.101.011.100.010.010.011.010.011.011.010.100.011.010.100.101
..010.011.101.010.000.000.000.001.000.001.100.001.101.001.010.011
..101.000.010.001.001.011.001.000.101.010.011.010.010.100.001.100
..000.100.001.101.100.100.101.100.001.101.001.000.000.000.000.000
..001.001.000.000.011.001.010.011.010.000.000.101.001.011.101.001
..011.010.100.011.101.101.100.101.100.100.101.011.100.101.011.010
CROSSREFS
Sequence in context: A282441 A281988 A394577 * A285485 A176127 A391511
KEYWORD
nonn
AUTHOR
R. H. Hardin, May 09 2011
STATUS
approved