18558391936domain: NAppears in sequencesNumber of intransitive (or alternating, or Stanley) trees: vertices are [0,n] and for no i<j<k are both (i,j) and (j,k) edges.at n=12A007889Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n).at n=11A079916