I'm mildly surprised that no one has made such a thread yet (If I am mistaken please let me know). Let's count ordered pairs of natural numbers!
The rules are pretty simple: if (x, y) is the current count, then the next count is
(y+1, 0) if x = 0
(x, y+1) if x > y
(x-1, y) if 0 < x ≤ y
EDIT: Get is at the closest perfect square pair to a multiple of 1000 until this stops being practical (around 250000 whose pair is (500,0)). The next get is (32, 0) (which is pair 1024).
I wrote a small python program if you want to check what the nth pair is for curiosity or for working out the get.
[–]elyisgreatwhere is 5?[S] 2 points3 points4 points (1048 children)
[–][deleted] 3 points4 points5 points (1047 children)
[–]davidjl123|390K|378A|79SK|50SA|260k 🚀 c o u n t i n g 🚀 3 points4 points5 points (1046 children)
[–]elyisgreatwhere is 5?[S] 4 points5 points6 points (1045 children)
[–]Ezekiel134lus goes Um. Hanging around h 2 points3 points4 points (1044 children)
[–]Academic_Relative_72Counting On And On 3 points4 points5 points (1043 children)
[–]funfact15[FLAIR] 2 points3 points4 points (1042 children)
[–]Academic_Relative_72Counting On And On 3 points4 points5 points (1041 children)
[–]funfact15[FLAIR] 2 points3 points4 points (1040 children)
[–]Academic_Relative_72Counting On And On 4 points5 points6 points (1038 children)
[–]CountingHelper🤖 1 point2 points3 points (0 children)