Let (P,<) be the strict partial order on the subsets of {1,2,...,n} ordered by their cardinality. Then a(n) is the number of paths of any length from {} to {1,2,...,n}.
A304902
Let (P,<) be the strict partial order on the subsets of {1,2,...,n} ordered by their cardinality. Then a(n) is the number of paths of any length from {} to {1,2,...,n}.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =16a(4) =175a(5) =4356a(6) =263424a(7) =40144896a(8) =15714084159
External references
- oeis: A304902