The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #19 Mar 23 2021 01:15:10
%S 5,10,17,23,23,24,34,39,39,45,46,71,71,71,71,95,95,95,95,95,95,95,95,
%T 96,101,106,113,119,119,120,130,159,159,159,159,159,159,159,159,183,
%U 183,183,183,183,183,189,190,287,287,287,287,287,287,287,287,287
%N Frobenius number of the odious numbers (A000069) starting with the n-th term.
%C The Frobenius number of a set S is the largest positive integer t such that t cannot be written as a nonnegative integer linear combination of the elements of S.
%C This sequence is 2-synchronized; there is a deterministic finite automaton accepting both n and a(n) in parallel, expressed in base 2. From this, values of the sequence at certain special values (e.g., powers of 2) are easily computed.
%H Jeffrey Shallit, <a href="https://arxiv.org/abs/2103.10904">Frobenius numbers and automatic sequences</a>, arXiv:2103.10904 [math.NT], 2021.
%e For n = 3, the Frobenius number of (4, 7, 8, 11, 13, ...) is 10.
%Y Cf. A000069. The analogous sequence for the evil numbers is A342581.
%K nonn,base
%O 2,1
%A _Jeffrey Shallit_, Mar 15 2021