login
A324917
a(n) = A134664(n) mod 2.
3
1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1
OFFSET
1
COMMENTS
It would be nice to have an alternative characterization of this sequence.
EXAMPLE
There are 114 3-stack-sortable permutations of {1,2,3,4,5}. Since 114 is even, a(5)=0.
CROSSREFS
Sequence in context: A358777 A359595 A353557 * A369974 A369975 A369001
KEYWORD
nonn
AUTHOR
Colin Defant, Mar 18 2019
STATUS
approved