Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Nov 29 2019 12:35:59
%S 1,1,2,4,9,23,66,209,718,2645,10373,43090,188803,869191,4189511
%N Arises in patience sorting and its generalizations.
%C Arises from a Neumann series, all of whose nonzero entries are positive integers. The sequence terms and the matrix from which they arise are given explicitly on pages 74-75 of Lankham's Ph.D. dissertation.
%H Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams, <a href="https://arxiv.org/abs/1906.06069">Combinatorial generation via permutation languages. I. Fundamentals</a>, arXiv:1906.06069 [cs.DM], 2019.
%H Isaiah Lankham, <a href="http://arXiv.org/abs/0705.4524">Patience Sorting and Its Generalizations</a>, 31 May 2007, Ph.D. dissertation, 108 pages.
%K nonn,more
%O 1,3
%A _Jonathan Vos Post_, Jun 01 2007
%E Broken URL replaced by _R. J. Mathar_, Jul 10 2009