As with the other problem of this kind, the problem description should be "Calculate the number of n-digit numbers that do not contain successive d-number of zeros at least."
Find the longest sequence of 1's in a binary sequence.
Convert String to Morse Code
Return fibonacci sequence do not use loop and condition version 3
Determine if input is a perfect number
Return fibonacci sequence do not use loop and condition
Determine if input is a Narcissistic number
Project Euler: Problem 14 Longest Collatz sequence(harder version)
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