The Frobenius number $g(S)$ of a set $S$ of non-negative integers with $\gcd 1$ is the largest integer not expressible as a linear combination of elements of $S$. Given a sequence ${\bf s} = (s_i)_{i \geq 0}$, we can define the associated sequence $G_{\bf s} (i) = g(\{ s_i,s_{i+1},\ldots \})$. In this paper we compute $G_{\bf s} (i)$ for some classical automatic sequences: the evil numbers, the odious numbers, and the lower and upper Wythoff sequences.

中文翻译：

---

Frobenius数和自动序列

带有$ \ gcd 1 $的一组非负整数$ S $的Frobenius数$ g（S）$是不能表示为$ S $元素的线性组合的最大整数。给定序列$ {\ bf s} =（s_i）_ {i \ geq 0} $，我们可以定义相关的序列$ G _ {\ bf s}（i）= g（\ {s_i，s_ {i + 1 }，\ ldots \}）$。在本文中，我们为一些经典的自动序列计算$ G _ {\ bf s}（i）$：邪恶数，可疑数以及上下Wythoff序列。