%I #12 Dec 25 2019 08:37:02
%S 2,2,4,5,9,11,21,30,51,76
%N Order of recurrence generating row (or column) n of A089934.
%C Table is A089934. Row/columns 1 through 7 are A000045, A001333, A051736, A051737, A089936, A089937, A089938.
%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 Cf. A000045, A001224, A001333, A051736, A051737, A089934, A089936, A089937, A089938.
%K nonn,hard,more
%O 1,1
%A _Marc LeBrun_, Nov 15 2003
%E a(8)-a(10) from _Andrew Howroyd_, Dec 24 2019