Habsieger, Laurent; Kazarian, Maxim; Lando, Sergei On the second number of Plutarch. (English) Zbl 0917.01011 Am. Math. Mon. 105, No. 5, 446 (1998). From the introduction of this article: “In this MONTHLY 104, 344–350 (1997; Zbl 0873.01002), Stanley discusses the following statement of Plutarch: “Chrysippus says that the number of compound propositions that can be made from only ten simple propositions exceeds a million. (Hipparcus, to be sure, refuted this by showing that on the affirmative side there are 103,049 compound statements, and on the negative side 310,952).” In particular, he describes Hough’s discovery: 103,049 appears to be the tenth Schröder number \(s(10)\). He also writes that the number 310,952 (\(\ldots\)) remains an enigma. We propose here an interpretation of the number 310,954 similar to Hough’s one. This might suggest a “misprint”, a miscalculation in the original statement, or the elimination of two cases for some reason connected to Stoic logic.” – The authors obtain their result by a number of bracketings on the string \(NO\; x_1 x_2 \ldots x_{10}\), applying recursion relations and generating functions. Reviewer: Christoph J. Scriba (Hamburg) Cited in 5 Documents MSC: 01A20 History of Greek and Roman mathematics 05A15 Exact enumeration problems, generating functions Citations:Zbl 0873.01002 PDFBibTeX XMLCite \textit{L. Habsieger} et al., Am. Math. Mon. 105, No. 5, 446 (1998; Zbl 0917.01011) Full Text: DOI Online Encyclopedia of Integer Sequences: Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of ’Schröder’ trees with n+1 leaves and root of degree 2.