WorksMathematics
Counting Second-Order Schreier Sets with Minimum 2
Abstract
A finite nonempty set is (first-order) Schreier if . These Schreier sets can be generalized recursively to higher-order Schreier sets, and we specifically investigate the second-order Schreier sets. We show that the count of second-order Schreier sets with minimum element and maximum element is one more than the term of the convolution of the Fibonacci numbers with (given by Sequence A023610 in the OEIS).