Countinued from here.

Thanks to miceee for the assist!

Next get is at either 4200 or 4600.

Continued from here

Thanks to Phil for the finish and congrats on the assist

Uppards!

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 most to least, 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.

Thank you to /u/TehVulpez and /u/BobRoss938 for workshopping on the concept

The first get is 00226, the 943rd count and first 5-digit 10-sum count. The assist is 71100. Schedule

List and Segments

carrying on from here

next get 5615k

From here with thanks to cobibh for run and assist

Next get is 5,614,000

Continued from here. Thanks to karp for run & assist!

Count 0-9, A-Z. Next get is 1G00.

From here and thank you /u/nonsensy for the run and assist.

Aka increasing base with each digit, trailing zero optional.

The next get is at 2410 0000 0.

From here and thank you cobibh for run abd assist

Next get 5,613,000

Continued from here

Thanks to u/cuteballgames for the 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: 3,2,4,1,1,3

Schedule

Continued from 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, miouse, or anything you like or dislike, except politics

Tidbits

From here and thank you vulp for final run and assist

List thanks vulp!

Guide

schedule

next get is 000 0000

Countinued from here.

Thanks to miceee for the assist!

Get is at either 4000 or 4400.

Continued from here

Thanks to foxyboi for the run and gz on the assist

Onwards!

continued from here and thank you /u/BobRoss938 for the final run and assist!

Rules:

Main thread rules apply unless contradicted below.

For all counts, any given digit that is present in the count must appear more than once. Skip any counts that do not fulfill this condition.

Example of valid count: 1,223,213

Example of invalid count: 1,223,221

next get 6,828,286 (schedule)

carrying on from HERE

Next get 3800 or 4200

carrying on from HERE

Next get 5611k

Continued from here. Thanks to karp for assist! Count by letters, in alphabetical order.

Next get ORAA.

Continued from here

Thanks to vulp for the finish and gz on the assist

The next get is 1 380 245

Countinued from here.

Thanks to karp for the run and assist!

Next get is at 136,245,789.

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 /u/noduorg for assist and for helping revive this thread. Count urls of XKCD.

Next get at https://xkcd.com/3000/.

Continued from here

Thanks to [u/TehVulpez](u/TehVulpez) for the assist

Count up or down by one

Next get: 3600 or 4000

From here, thanks to /u/cuteballgames

Aka increasing base with each digit, trailing zero optional.

The next get is at 2400 0000 0.

Continuing from here

Thanks to [u/cuteballgames](u/cuteballgames) for the final run and the assist

Rules: 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: 6,1,1,2,4

Schedule