Define a sequence of finite sets S_m \subset \mathbb{N} by the initial conditions
and the recurrence for m \ge 3:
where the operations are defined as follows.
Definitions
Characteristic function.
Each finite set A \subset \mathbb{N} is identified with its characteristic function
\mathbf{1}_A : \mathbb{N} \to \mathbb{F}_2, where \mathbf{1}_A(n) = 1 if n \in A and 0 otherwise.
Subset-sum (zeta) transform \zeta.
Given a finite set A \subset \mathbb{N}, define \zeta(A) as the set whose characteristic function is
where s \subseteq t means that every bit set in the binary representation of s is also set in t
(i.e. s \mathbin{\&} t = s, the bitwise AND condition).
This is the Möbius/zeta transform on the Boolean lattice 2^{\mathbb{N}}, reduced modulo 2.
Union \cup (pointwise OR over \mathbb{F}_2).
Given two finite sets A, B \subset \mathbb{N}, the operation A \cup B is simply the set union.
Equivalently, in terms of characteristic functions:
Increment \operatorname{Inc}.
\operatorname{Inc}(A) = \{a + 1 \mid a \in A\}, i.e. shift every element up by one.
Computed values
Carrying out the recurrence by hand (or by computer), the first several sets are:
Question
Is there a closed-form expression for the set S_m, or equivalently a closed-form formula for the
membership predicate
as a function of (m, r)?
Any structural insight is welcome: a characterisation
in terms of binary representations of m and r, asymptotic growth of |S_m| or \max S_m, etc.