Jump to content

Solve hanging lantern problem: Difference between revisions

see talk page
m (Disambiguation)
(see talk page)
Line 1:
{{draft task}}
 
There are some columns of lanterns hanging from the ceiling. If you remove the lanterns one at a time, at each step removing the bottommost lantern from one column, how many legal sequences will let you take all of the lanterns down?
6,962

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.