Timeline for Hacking an electronic keypad
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2018 at 11:15 | comment | added | cinico | Seems right to me, but I would prefer to see a practical reasoning to get a full sequence of buttons pressed. Something like: write all the possible combinations, then start with one combination and try to attach an unrepeated combination that starts with the last previously pressed buttons. If it's not possible, try to continue with a combination that starts with the last pressed buttons. | |
| Mar 22, 2018 at 20:08 | comment | added | Freyja | The pattern of this sequence is A180632 in the Online Encyclopedia of Integer Sequences, which follows your pattern for $n=1,2,3,4,5$. However, it is not known how the pattern continues for $n > 5$, but it is strictly less than the pattern you suggests (according to the OEIS entry, at least). | |
| Mar 22, 2018 at 14:16 | history | answered | w l | CC BY-SA 3.0 |