Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.
A053440
Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.
Terms
- a(0) =1a(1) =3a(2) =2a(3) =7a(4) =12a(5) =6a(6) =15a(7) =50a(8) =60a(9) =24a(10) =31a(11) =180a(12) =390a(13) =360a(14) =120a(15) =63a(16) =602a(17) =2100a(18) =3360a(19) =2520a(20) =720a(21) =127a(22) =1932a(23) =10206a(24) =25200a(25) =31920a(26) =20160a(27) =5040a(28) =255a(29) =6050
External references
- oeis: A053440