OFFSET

2,1

COMMENTS

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.

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.

LINKS

Jeffrey Shallit, Frobenius numbers and automatic sequences, arXiv:2103.10904 [math.NT], 2021.

EXAMPLE

For n = 3, the Frobenius number of (4, 7, 8, 11, 13, ...) is 10.

CROSSREFS

KEYWORD

nonn,base

AUTHOR

Jeffrey Shallit, Mar 15 2021

STATUS

approved