1030800

Appears in sequences

• a(0) = 1, a(1) = 0, a(2) = a(3) = 1; thereafter, a(n) = a(n-1) + a(n-2) + a(n-4).at n=27A347493
• a(n) is the number of permutations pi of [n] that avoid {231,321} so that pi^4 avoids 132.at n=25A368299