Talk:Solve hanging lantern problem
The Julia solution considers two columns with the same number of lanterns indistinguishable, and therefore outputs a total of only 7 sequences when given 3 columns of 1, 3, and 3 lanterns. Since the problem statement gives an example in which each lantern is individually numbered, I infer that columns with the same number of lanterns should not be interchangeable and 3 columns [1,3,3] should yield 140 distinct sequences. But perhaps some more clarity and/or examples in the problem statement is called for. -- Markjreed (talk) 21:24, 22 May 2022 (UTC)