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 A089935 #20 Dec 12 2024 11:09:04 %S A089935 2,2,4,5,9,11,21,30,51,76,127,195,322,504,826 %N A089935 a(n) = order of recurrence generating row (or column) n of A089934. %C A089935 The only known value where a(n) is strictly less than the theoretical upper bound A001224(n+1) is a(6) = 11. - _Andrew Howroyd_, Dec 24 2019 %F A089935 a(n) <= A001224(n+1). - _Andrew Howroyd_, Dec 24 2019 %e A089935 a(2)=2 because the recurrence relation for the second row/column is a(n) = 2 a(n-1) + a(n-2). %Y A089935 Row/columns 1 through 7 of A089934 are A000045, A001333, A051736, A051737, A089936, A089937, A089938. %Y A089935 Cf. A001224. %K A089935 nonn,hard,more %O A089935 1,1 %A A089935 _Marc LeBrun_, Nov 15 2003 %E A089935 a(8)-a(10) from _Andrew Howroyd_, Dec 24 2019 %E A089935 a(11)-a(15) from _Max Alekseyev_, Dec 12 2024