Triangle read by rows: T(n,k) is the number of white corners of rank k in all the permutations of {1,2,...,n} (n>=2, 0<=k<=n-2; for definitions see the Eriksson-Linusson references).
A140713
Triangle read by rows: T(n,k) is the number of white corners of rank k in all the permutations of {1,2,...,n} (n>=2, 0<=k<=n-2; for definitions see the Eriksson-Linusson references).
Terms
- a(0) =1a(1) =5a(2) =1a(3) =26a(4) =9a(5) =2a(6) =154a(7) =70a(8) =26a(9) =6a(10) =1044a(11) =562a(12) =268a(13) =102a(14) =24a(15) =8028a(16) =4860a(17) =2700a(18) =1308a(19) =504a(20) =120a(21) =69264a(22) =45756a(23) =28224a(24) =15828a(25) =7728a(26) =3000a(27) =720
External references
- oeis: A140713