n of unique possible sets in sequences(ABC = CBA), with order ignored.
this why it was possible to extract combinations from permutations without iterations, by only eliminating similar characters with matching characters.
That brings the question, whether it's possible to generate the combinations (56) without generating the whole possible (336) permutations, which already took around 8000 iterations
…
Added by Mohamed Naeim at 9:01pm on November 3, 2016
"FabCafe Tokyoの金岡です。11/27(木) 19:00~ 『Open Fab Night for Rhinoceros+Grasshopper』の第二回を開催することになりました!皆様お気軽にお越しください! 詳しくはこちらhttps://www.facebook.com/events/304841829703141/
E.g.:
0 2 (A) = 2
1 2+4 (A+B) = 6 (AB)
2 6+4 (AB+C) = 10 (ABC)
3 10+6 (ABC+D) = 16 (ABCD)
etc.
Into a new list numbers:
{2,6,10,16, etc} that adding the previous number with the next number.
Thanks,
daniel
…