|
|
A089935
|
|
Order of recurrence generating row (or column) n of A089934.
|
|
4
|
|
|
|
OFFSET
|
1,1
|
|
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
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(2)=2 because the recurrence relation for the second row/column is a(n) = 2 a(n-1) + a(n-2).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|