I had more of an idea for the Pascal Triangle one using combinations to calculate the numbers in each row. It's a bit complicated trying to think out how to do that — it would need factorials, and then converting each number into binary. And then trying to use that information for the clones...
Snippets of ideas for code...
set result to 1
set number to 1
Repeat times n:
set result to (result * number)
increase value number by 1
set result to factorial(n) / (factorial(k) * factorial(n-k))
(these are just initial ideas, not even implementation in Hopscotch yet...) This is from:
And then trying to represent a number in binary...
// Keep subtracting the highest possible power of 2 from the number
This was just for one of the projects, and I was commenting my ideas for it. We absolutely do not have to start with this!