Wikipedia:Reference desk/Archives/Mathematics/2019 February 5

= February 5 =

Coloured bricks - historical
I'm trying to remember the name of the man who noticed a pattern formed by his son's coloured bricks and did some sort of analysis of the pattern, extending it to larger cases. Unfortunately, I can't remember just what his name has been attached to - problem? algorithm? formula? Does this strike a chord with anyone? 2A00:23C6:AA05:6500:E1C7:3C6:6804:256F (talk) 15:47, 5 February 2019 (UTC)


 * Wang tile? 196.213.35.147 (talk) 09:18, 6 February 2019 (UTC)


 * This one? Tamanoeconomico (talk) 17:18, 6 February 2019 (UTC)


 * (OP) No, neither. I've just now remembered - it was C. Dudley Langford, as in Langford pairing, and his son had two of each of several coloured bricks. The problem was to stack them such that (say) the red bricks had one other between them, the blue had two others between them, the green had three others between them, etc. In terms of integers, 312132 is a solution for two of each up to 3. 2A00:23C6:AA05:6500:5882:8A3D:449B:24C (talk) 17:21, 7 February 2019 (UTC)