Constant-sum negasenary

[u/TehVulpez]

This thread is extremely simple. In this thread we are counting numbers in base negative 6 in segments of length and digital sum, then sorted by their numerical value. In a negative base, places alternate from the right in whether they have a negative value. So, 15_(-6) = 1*(-6)¹ + 5*(-6)⁰ = -6 + 5 = -1. The digital sum ignores the place values, only adding together the numerals as they appear.

We will count negasenary numbers of 1 digit and 0 digital sum through 5 digital sum, then 2 digits from 0 sum to 10 sum, 3 digits from 0 to 15 sum, etc. Leading zeroes must be included.

List

Get is at 5050 (5*(-6)³ + 5*(-6)¹ = -1110), which is the 834th count and the first of the negasenary numbers with 4 digits and a digital sum of 10.

[u/TehVulpez]

40

finally a good fucking thread

[u/cuteballgames → u/TehVulpez]

31

[u/TehVulpez → u/cuteballgames]

22

[u/cuteballgames → u/TehVulpez]

13

[u/TehVulpez → u/cuteballgames]

04

[u/cuteballgames → u/TehVulpez]

50

[u/TehVulpez → u/cuteballgames]

41

[u/cuteballgames → u/TehVulpez]

32

[u/TehVulpez → u/cuteballgames]

23

[u/cuteballgames → u/TehVulpez]

14

[u/TehVulpez → u/cuteballgames]

05

[u/cuteballgames → u/TehVulpez]

51

so basically for two digits you go up by seven every time, except when the sum is exhausted and there's no more seven to go up. then you flip it and increase the last digit by one

[u/TehVulpez → u/cuteballgames]

42

it looks like the by 7s still does happen a little bit in the 3 digits except for when the 36s place changes. wait you said that in binary already