This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A342716 #11 Mar 23 2021 02:57:15 %S A342716 3,16,19,42,42,42,55,58,76,79,79,110,110,110,118,121,144,144,144,155, %T A342716 160,173,181,181,207,207,207,220,223,254,254,254,275,275,275,283,283, %U A342716 309,309,309,320,325,343,346,346,377,377,377,385,388,406,409,409,422 %N A342716 Frobenius number of the upper Wythoff sequence (A001950), starting with the n-th term. %C A342716 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 A342716 The sequence a(n) is "Fibonacci-synchronized"; there is an automaton that recognizes the Fibonacci representation of the pairs (n, a(n)) in parallel. This means specific values of a(n) are easily computed. %H A342716 Jeffrey Shallit, <a href="https://arxiv.org/abs/2103.10904">Frobenius numbers and automatic sequences</a>, arXiv:2103.10904 [math.NT], 2021. %Y A342716 Cf. A001950, A342715 (analog for the lower Wythoff numbers). %K A342716 nonn %O A342716 1,1 %A A342716 _Jeffrey Shallit_, Mar 19 2021