971055240domain: 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=11A007889Solution to the Dancing School Problem with 10 girls and n+10 boys: f(10,n).at n=10A079915