Is it possible to write a recursive function for this problem?
Remove any row in which a NaN appears
Create a vector whose elements depend on the previous element
Say something funny
Divisible by 3
Low level NaN
Your favourite city!
Repeat string n times
Repeat string n times - 3
Van Eck's Sequence's nth member
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