Cody

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

Solution 1507649

Submitted on 28 Apr 2018 by Daniel Meier
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

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

ans = 1
2   Pass
assert(isequal(euler341(10),5))

ans = 5
3   Pass
assert(isequal(euler341(310),42))

ans = 42
4   Pass
assert(isequal(euler341(4242),210))

ans = 210
5   Pass
assert(isequal(euler341(328509),3084))

ans = 3084
6   Pass
assert(isequal(euler341(551368),4247))

ans = 4247
7   Pass
assert(isequal(euler341(614125),4540))

ans = 4540

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!