If the binary expansion of n has k bits, let S be the subset of [k-1] such that i is in S if the i-th bit of n is a 1 (with the first bit being the least significant bit); a(n) is the number of permutations of [k] with descent set S.
A060351
If the binary expansion of n has k bits, let S be the subset of [k-1] such that i is in S if the i-th bit of n is a 1 (with the first bit being the least significant bit); a(n) is the number of permutations of [k] with descent set S.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =1a(8) =1a(9) =3a(10) =5a(11) =3a(12) =3a(13) =5a(14) =3a(15) =1a(16) =1a(17) =4a(18) =9a(19) =6a(20) =9a(21) =16a(22) =11a(23) =4a(24) =4a(25) =11a(26) =16a(27) =9a(28) =6a(29) =9
External references
- oeis: A060351