A089935 a(n) = order of recurrence generating row (or column) n of A089934.

2, 2, 4, 5, 9, 11, 21, 30, 51, 76, 127, 195, 322, 504, 826

Offset: 1

Author

Marc LeBrun, Nov 15 2003

Keywords

• nonn
• hard
• more

Comments

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

Examples

			a(2)=2 because the recurrence relation for the second row/column is a(n) = 2 a(n-1) + a(n-2).
		

Crossrefs

Row/columns 1 through 7 of A089934 are A000045, A001333, A051736, A051737, A089936, A089937, A089938.

Cf. A001224.

Formula

a(n) <= A001224(n+1). - Andrew Howroyd, Dec 24 2019

Extensions

a(8)-a(10) from Andrew Howroyd, Dec 24 2019

a(11)-a(15) from Max Alekseyev, Dec 12 2024