3598120

Appears in sequences

• Number 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=9A007889
• Solution to the Dancing School Problem with 8 girls and n+8 boys: f(8,n).at n=8A079913
• Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).at n=7A079927