This solution together with the solution of James' (or mine) exhibits a nice duality between the "top-down" and "bottom-up" approaches.
Nice! When you go from the bottom, solution automatically goes to a(1).
Thanks. I coded that solution up LONG before movmax became a thing...
Arrange vector in ascending order
Create a Multiplication table matrix...
frame of the matrix
Convert to Binary Coded Decimal
Return fibonacci sequence do not use loop and condition version 2
Project Euler: Problem 14, Longest Collatz sequence
Project Euler: Problem 11, Largest product in a grid
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office