Cody

Problem 1190. Golomb's self-describing sequence (based on Euler 341)

Solution 2885981

Submitted on 28 Aug 2020 by PurpleDiab
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
assert(isequal(euler341(1),1))

n = 3

2   Pass
assert(isequal(euler341(10),5))

n = 3

3   Pass
assert(isequal(euler341(310),42))

n = 3

4   Pass
assert(isequal(euler341(4242),210))

n = 3

5   Pass
assert(isequal(euler341(328509),3084))

n = 3

6   Pass
assert(isequal(euler341(551368),4247))

n = 3

7   Pass
assert(isequal(euler341(614125),4540))

n = 3

Suggested Problems

More from this Author80

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!