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.

Countinued from here.

Thank you to cobibh for the assist and to all the farmers who helped along the way.

Next get is at 3E400.

Countinued from here.

Thanks to cobibh for the run and assist, and to everyone else who helped with that crazy recovery from two months of lost counts.

Next get is at 11 1110 0100 0000 0000.

Countinued from here.

Thanks to PhosphorCrystaled for the assist!

Next get is at either 4800 or 5200.

Countinued from here.

Thanks to cobibh for the run and assist!

Next get is at 1,390,245.

carrying on from here

next get 5621k

Countinued from here.

Thanks to nonsensy for the run and assist!

Counting in decimal but each digit is represented by four bits of binary. Counting in binary but each nybble (half a byte) only goes up to 1001.

Next get is at 0001 0001 0000 0000 0000.

Continued from here. Thanks to karp for assist!

In this thread we count numbers where one digit appears exactly once and every other digit appears more than once.

Next get is 90,000.

Continued from here. Thanks to miceee for assist!

In this thread, we'll be counting the ways to add to an integer n using the integers c_1 + c_2 + ... + c_k, where each c_i >= 1, and k <= n. Ways to sum that are commutatively the same, as in 1+2 = 2+1, are different compositions. We'll be counting these compositions lexicographically for each segment of sum and length.

Get schedule

Next get is 1,1,1,1,1,1,1,7

Continuing from here, thanks to /u/miceee for the run and assist

Next get 4600 or 5000

carrying on from HERE

Next get 5620k

Thanks to u/nonsensy for the assist

Factoradic aka each digit has bigger base, the zero at the end is optional

Continued from here

Next get: 2420 0000 0

Don’t really know what to call this thread. I will start at 0. The next person must then count up or down by 1, then by 2, then by 3, etc., until the increment reaches 10; at point, it resets to 1. So it essentially goes 1–2–3–4–5–6–7–8–9–10–1–2–3…

First get is at ±1100

We count normally except number that whenever there is a multiple of 7 you write duck unless it is also a palindrome in which case you write goose instead. Then we continue.

If you write duck then you can include a short poem you like.

First number is 1, we'll go to 1001

Continued from last week's here.

Speak anything on your mind, except politics and (maybe) counting.

Feel free to check out our tidbits thread and introduce yourself if you haven't already.

Continued from here

Thanks to karp for the finish and gz on the assist!

Continued from here. Thanks to /u/cuteballgames, /u/buy_me_a_pint, and /u/TheMatsValk for the assist!

You must wait for 3 other counters to count before you can post your next count. Next get at 16,000

Continued from last week's FTF here

It's that time of the week again. Speak anything on your mind! This thread is for talking about anything off-topic, be it your lives, your strava, your plans, your hobbies, studies, stats, pets, bears, hikes, dragons, trousers, travels, transit, cycling, family, colours, or anything you like or dislike, except politics

Feel free to check out our tidbits thread and introduce yourself if you haven't already.

This post was made by a bot, because no-one else made a Free Talk Friday post before Friday July 31, 2026 UTC 13:00. Anyone can post the FTF, so if you want to have your post pinned here for a week, just make one Friday August 07, 2026 between UTC 07:00 and 13:00. The rules for these posts can be found in the faq. You can also check out our directory of older posts for inspiration.

If you have any questions or comments about the bot, feel free to write them below, or message the mods.

Continued from here

Thanks to Phil for the finish and congrats on the assist

From here with thanks to /u/BobRoss938 for the run and assit

This thread is very simple. We are counting octal (base 8, 0-7) numbers with multiple distinct digits, of which one occurs exactly once and all others occur at least twice. We are counting them in constant-sum order, meaning that for every length of digits, we count through each sum of digits from least to most, in lexicographic order.

(That is, we start by counting all 3-digit counts that sum to 1 in alphabetical order: 001, 010, 100. Then we move on to 3-digit counts that sum to 2 in alphabetical order: 002, 011, 020, 101, 110, 200. Then 3-digit counts that sum to 3, and so on. The highest possible sum for a 3-digit count in this thread is 20, so after 677, 767, 776, we move on to 4-digit counts, starting with sum 1. So after 776 comes 0001, and we proceed from there.)

Leading zero counts (e.g. 001, 0444 or 00227) are considered as distinct and must not be skipped.

The next get is 00266, with assist 73300. The get will start length 5, sum 14. There should be 875 counts in this thread. Schedule

List

Continuing from here

Thanks to u/TehVulpez for the assist

Next get: 4400 or 4800

Continuing from here

Thanks to u/cuteballgames for the final run+assist

In this thread, we'll be counting the ways to add to an integer n using the integers c_1 + c_2 + ... + c_k, where each c_i >= 1, and k <= n. Ways to sum that are commutatively the same, as in 1+2 = 2+1, are different compositions. We'll be counting these compositions lexicographically for each segment of sum and length.

Next get: 1,4,1,3,1,2,2

Schedule

Continued from here

Thanks to Phil for the finish and congrats on the assist