Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Dec 12 2024 11:09:04
%S 2,2,4,5,9,11,21,30,51,76,127,195,322,504,826
%N a(n) = order of recurrence generating row (or column) n of A089934.
%C 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 a(n) <= A001224(n+1). - _Andrew Howroyd_, Dec 24 2019
%e a(2)=2 because the recurrence relation for the second row/column is a(n) = 2 a(n-1) + a(n-2).
%Y Row/columns 1 through 7 of A089934 are A000045, A001333, A051736, A051737, A089936, A089937, A089938.
%Y Cf. A001224.
%K nonn,hard,more
%O 1,1
%A _Marc LeBrun_, Nov 15 2003
%E a(8)-a(10) from _Andrew Howroyd_, Dec 24 2019
%E a(11)-a(15) from _Max Alekseyev_, Dec 12 2024