A set of positive integers is defined to be wicked if it contains no three consecutive integers. We count the empty set, which contains no elements at all, as a wicked set. Find the number of wicked subsets of the set .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!