minicomplexity
iterated long length
 Given a unary string, check that its length is a nonzero multiple of $2^h$.
 For every $h\geq 1$, iterated long length$h$ (or just illen$h$) is defined over the unary alphabet $\{\mathtt0\}$. Its instances are all unary strings. An instance is positive if its length is $\lambda 2^h$, for some $\lambda\geq1$; otherwise, the instance is negative. E.g., the two shortest positive instances of illen$3$ are $\mathtt{00000000}$ and $\mathtt{0000000000000000}$.
 Introduced by this site, as a variant of iterated length for exponential basic length. See long length for the variant where the length must be exactly $2^h$, and iterated length for the variant where the length must be a multiple of $h$.
1N
1N 1D re-1D re-1N co-1D rc-1D 1D/uny 1N/uny re-1D/uny re-1N/uny co-1D/uny rc-1D/uny
 – no record –
 – no record –
 – no record –