|
Search: id:A111235
|
|
|
| A111235 |
|
a(1)=a(2)=a(3)=a(4)=1. For n >= 5, a(n)= a(n-1)*a(n-2) + a(n-3)*a(n-4). |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 3, 7, 23, 167, 3862, 645115, 2491437971, 1607264007306619, 4004398577225334507664179, 6436125704084114770053956998574742562466, 25772812612277833490303309040566300172816894832780792086674335463
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
a(5*n) is always even. Every other term of the sequence is odd.
It is easy to see that a(n) >= A000301(n-3) for all n. From that we can deduce that a(n) >= 2^(Fibonacci(n-3)). Can anybody give a formula for the asymptotic behaviour? - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 21 2006
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
CROSSREFS
|
Sequence in context: A090253 A001064 A108176 this_sequence A066356 A006892 A102710
Adjacent sequences: A111232 A111233 A111234 this_sequence A111236 A111237 A111238
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Oct 28 2005
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 21 2006
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 04 2006
|
|
|
Search completed in 0.002 seconds
|
