Correct idea. But take care of the overflow. This sequence just explodes at high values of n. Try enhancing the modular arithmetic in it.
I didn't expected the recursion to work because of it's exponential time complexity O(3^(n-3)). But it worked :O.
Nicely written code. ^_^
Project Euler: Problem 6, Natural numbers, squares and sums.
Triangle Numbers Below N
Is X a Fibonacci Matrix?
Sum of diagonals elements of a matrix
Find the first N zeros of the 666 function
Sum of infinite series.
Modulo of sum of square of first n primes with 24
Modulo with 5
Simple sum 1
sum of binomial series
Find the treasures in MATLAB Central and discover how the community can help you!
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