Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089935
Order of recurrence generating row (or column) n of A089934.
4
2, 2, 4, 5, 9, 11, 21, 30, 51, 76
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Table is A089934. Row/columns 1 through 7 are A000045, A001333, A051736, A051737, A089936, A089937, A089938.
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
Table of n, a(n) for n=1..10.
FORMULA
a(n) <= A001224(n+1). - Andrew Howroyd, Dec 24 2019
EXAMPLE
a(2)=2 because the recurrence relation for the second row/column is a(n) = 2 a(n-1) + a(n-2).
CROSSREFS
Cf. A000045, A001224, A001333, A051736, A051737, A089934, A089936, A089937, A089938.
Sequence in context: A144118 A187069 A038000 * A204856 A323531 A124280
Adjacent sequences: A089932 A089933 A089934 * A089936 A089937 A089938
KEYWORD
nonn,hard,more
AUTHOR
Marc LeBrun, Nov 15 2003
EXTENSIONS
a(8)-a(10) from Andrew Howroyd, Dec 24 2019
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 28 17:16 EDT 2024. Contains 376297 sequences.
License Agreements, Terms of Use, Privacy Policy