%I #20 Nov 30 2022 12:39:32
%S 1,1,2,2,1,5,2,1,1,1,1,1,1,4,6,1,2,1,4
%N Topswops: number of permutations of cards achieving A000375(n).
%D D. E. Knuth, TAOCP, Section 7.2.1.2, Problems 107-109.
%H Kento Kimura, Atsuki Takahashi, Tetsuya Araki, and Kazuyuki Amano, <a href="https://arxiv.org/abs/2103.08346">Maximum Number of Steps of Topswops on 18 and 19 Cards</a>, arXiv:2103.08346 [cs.DM], 2021.
%H Yuichi Komano and Takaaki Mizuki, <a href="https://doi.org/10.1007/978-3-031-21280-2_30">Physical Zero-Knowledge Proof Protocol for Topswops</a>, Int'l Conf. Info. Sec. Practice and Experience (ISPEC 2022) Lecture Notes in Comp. Sci. book series (LNCS Vol. 13620) Springer, Cham, 537-553.
%Y Cf. A000375.
%K nonn,more
%O 1,3
%A _N. J. A. Sloane_, Oct 15 2006
%E Added a(17)=2 using comments in A000375 from Quan T. Nguyen, William Fahle; by _Moritz Franckenstein_, Nov 27 2010
%E a(18)-a(19) from Kimura et al. added by _Andrey Zabolotskiy_, Mar 24 2021