I wanted to point out that this playful calculation applied to the LOTTO was born from the study of a possible way of enumerating the 4 DNA BASES (A, T/U, C, G) that are usually converted into binary pairs {{1,1}, {1,0}, {0,1}, {0,0}}, and generate the 64 possible permutation 6-digit binary codons (groups of 3 bases) and that encode 23 between amino acids and START / STOP codons. if 000000 = 0 and 111111 = 63 (the 64th codon) calculating the possible MIXED ROOTS that generates 111111 = 22 (the 23rd amino acid), we can get possible NON EXPONENTIAL enumeration systems that can be used to study DNA sequences.

it can also be used to investigate ICHING, where, if Leibnitz used trigrams and hexagrams as a model to encoding binary arithmetic, no one has ever explained how each of the 64 hexagrams has been assigned a decimal number over the centuries.