Sequencer | StrangerCoug's turn

[DeathRowKitty]

If they're added back in, they should be shuffled into the remaining cards instead of being put at the bottom imo.

[StrangerCoug]

Since McMenno is probably not coming back, should i add his hand to the bottom of the deck?

Sure.

Edited to add:

If they're added back in, they should be shuffled into the remaining cards instead of being put at the bottom imo.

Though good point.

[Felissan]

I'll get to it tomorrow, I've had a highly stressful day today.

[Plotinus]

I hope today goes better for you. It will be popsofctown's turn in (expired on 2019-11-08 08:30:00) or as soon as Felissan goes.

[popsofctown]

If Felissan is at a computer the same time of day today as she was yesterday, that deadline expires just a couple hours before she'd be able to post.
Can we give her like six more hours at least?
You can take it out of my time, I donate it, my turn will have to be six hours faster.

[Plotinus]

I gave her 24 hours from the time I posted, which is 31 hours from the time she last posted, but I don't mind giving her some more time. (expired on 2019-11-08 14:30:00).

[Felissan]

Pass. Feel free to remove me if I don't get better by my next turn.

[Plotinus]

get well soon!

[popsofctown]

i guess I am bad at math? Because I got less than 24 hours from the time she posted. I should probably be sure not to play any mathbased mishmash games for sure.

I should be able to take my turn tomorrow morning.

[Plotinus]

The countdown timers show the time remaining from when you loaded the page, not from when I posted it, so that's probably where the mistake happened.

[Plotinus]

popsofctown has been prodded. It will be StrangerCoug's turn in (expired on 2019-11-09 17:25:50) or as soon as popsofctown goes. I'll shuffle McMenno's cards into the remaining deck before the next time somebody draws a card, unless someone objects before then.

[popsofctown]

I think I might need to replace out

I just look at the game and don't feel excited about playing

[Plotinus]

Okay, thanks for letting us know. I'll ask errant if she's still interested in replacing in.

[StrangerCoug]

Add 52 to 16n+4

[implosion]

1, 16, 64 to finish powers of 2

[Plotinus]

Spoiler: Finished sequences:

• [5, 9, 10, 27, 48, 66, 98] {
  n² ± [0, 2]
  } numbers within 2 of a perfect square,
  
• [13, 15, 51, 53, 55, 73, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 0
  } numbers with at least two digits, all of which are odd
  
• [10, 21, 23, 45, 46, 59, 70] {
  n is 0 or odd (mod 9)
  } numbers that are odd when you repeatedly sum their digits
  
• [6, 7, 8, 13, 18, 20, 24, 34, 40] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.
  
• [12, 20, 35, 62, 85, 95, 100] numbers that are the sum of the proper divisors of some number < 1000 not in the deck for this game.
  
• [11, 17, 19, 29, 43, 71, 83] primes
  
• [5, 6, 13, 15, 16, 27, 100] numbers used in 0, including substrings of other numbers, but not including the deck spoiler
  
• [10, 21, 56, 57, 64, 76, 729] integers n for which there exists some integer m such that (n-1)/3^m and (n-2)/3^m are each endpoints of intervals removed during (possibly different) steps of the usual construction of the Cantor set (i.e. the construction in which each step removes the middle third of intervals existing after the previous step)
  
• [1, 10, 15, 28, 36, 78, 120] {
  n*(n-1)/2)
  }: triangular numbers
  
• [1, 4, 9, 16, 25, 64, 81] {
  n²
  } squares
  
• [7, 8, 9, 25, 37, 47, 49] {
  p^k | p^k < 50, prime p, k > 0
  }
  \
  {
  19, 27
  } numbers less than 50 with exactly 1 prime factor
  
• [12, 15, 19, 34, 35, 45, 49] 2 digit numbers with increasing digits
  
• [7, 14, 35, 42, 56, 63, 343] {
  7n
  } divisible by 7
  
• [8, 18, 29, 79, 87, 92, 96] {
  maxdigit(n) > 7
  } numbers that contain an 8 or 9
  
• [3, 4, 5, 7, 21, 22, 64] the nth prime doesn't have any even digits
  
• [1, 3, 6, 26, 54, 80, 220] numbers n for which there exists some positive integer with exactly 2n primitive roots
  
• [4, 13, 18, 27, 72, 88, 97] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = k^2 | a_i ≥ 0, d > 0, k ∈ ℤ
  } numbers whose digit sum is a square
  
• [3, 21, 24, 33, 39, 84, 165] {
  3n
  } multiples of 3
  
• [1, 2, 4, 16, 32, 64, 256] {
  2ⁿ
  } powers of two

Implosion has 42 points and:

• [30, 42, 65] Composite squarefree numbers where when you take the sum of prime factors and write it in english, at least 1/3 of the letters in the word are "e"
  
• [9, 17, 69, 77] {
  n ≡ 1 (mod 4) ∧ n ≥ 7 (mod 10)
  } Numbers congruent to 1 mod 4 whose last digit, written in english, can have the letters "ty" appended to the end of it to multiply it by ten (e.g., "six" times ten is "sixty", but "fourty" is not a number, so the last digit cannot be four)
  
• [5, 6, 50, 125] Numbers such that if you take the number of letters in the english spelling and add that to the number, and then repeat that process a second time, the result is in the range 11-15 mod 50 (inclusive).
  
• [2, 3, 23, 56] Numbers where each pair of consecutive digits differ by exactly one

DeathRowKitty has 44 points and:

• [38, 82, 84] slots never touched by Ace, 5, or 9 in perfect out-shuffles of standard 52 card decks, mod 52

Felissan has 21 points and:

popsofctown has 14 points and is being replaced:

• [55, 58, 60] {
  n, k, c st n is composite; k - c is perfect; c|n; k = max(d) st d|n ∧d ≠ n
  } composite number whose greatest non-trivial divisor minus any of its other divisors is a perfect number
  
• [30, 40, 55, 75] {
  25 + (5n * (n + 1) / 2)
  } 25 + 5n, where n is a triangular number

StrangerCoug has 14 points and:

• [5, 7, 10, 14] {
  n*(n-1)/2) + 4
  } triangular numbers + 4
  
• [4, 20, 36, 52, 68] {
  16n + 4
  } remainder is 4 when dividing by 16

McMenno's hand has been shuffled into the deck. There are 26 cards left in the deck. It is DeathRowKitty's turn.

[Plotinus]

DeathRowKitty has been prodded. It will be Felissan's turn in (expired on 2019-11-11 18:39:03) or as soon as DeathRowKitty goes.

[DeathRowKitty]

will get to this in the morning, sorry

[DeathRowKitty]

[1, 31, 61] numbers relatively prime to 210

[Plotinus]

Spoiler: Finished sequences:

• [5, 9, 10, 27, 48, 66, 98] {
  n² ± [0, 2]
  } numbers within 2 of a perfect square,
  
• [13, 15, 51, 53, 55, 73, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 0
  } numbers with at least two digits, all of which are odd
  
• [10, 21, 23, 45, 46, 59, 70] {
  n is 0 or odd (mod 9)
  } numbers that are odd when you repeatedly sum their digits
  
• [6, 7, 8, 13, 18, 20, 24, 34, 40] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.
  
• [12, 20, 35, 62, 85, 95, 100] numbers that are the sum of the proper divisors of some number < 1000 not in the deck for this game.
  
• [11, 17, 19, 29, 43, 71, 83] primes
  
• [5, 6, 13, 15, 16, 27, 100] numbers used in 0, including substrings of other numbers, but not including the deck spoiler
  
• [10, 21, 56, 57, 64, 76, 729] integers n for which there exists some integer m such that (n-1)/3^m and (n-2)/3^m are each endpoints of intervals removed during (possibly different) steps of the usual construction of the Cantor set (i.e. the construction in which each step removes the middle third of intervals existing after the previous step)
  
• [1, 10, 15, 28, 36, 78, 120] {
  n*(n-1)/2)
  }: triangular numbers
  
• [1, 4, 9, 16, 25, 64, 81] {
  n²
  } squares
  
• [7, 8, 9, 25, 37, 47, 49] {
  p^k | p^k < 50, prime p, k > 0
  }
  \
  {
  19, 27
  } numbers less than 50 with exactly 1 prime factor
  
• [12, 15, 19, 34, 35, 45, 49] 2 digit numbers with increasing digits
  
• [7, 14, 35, 42, 56, 63, 343] {
  7n
  } divisible by 7
  
• [8, 18, 29, 79, 87, 92, 96] {
  maxdigit(n) > 7
  } numbers that contain an 8 or 9
  
• [3, 4, 5, 7, 21, 22, 64] the nth prime doesn't have any even digits
  
• [1, 3, 6, 26, 54, 80, 220] numbers n for which there exists some positive integer with exactly 2n primitive roots
  
• [4, 13, 18, 27, 72, 88, 97] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = k^2 | a_i ≥ 0, d > 0, k ∈ ℤ
  } numbers whose digit sum is a square
  
• [3, 21, 24, 33, 39, 84, 165] {
  3n
  } multiples of 3
  
• [1, 2, 4, 16, 32, 64, 256] {
  2ⁿ
  } powers of two

Implosion has 42 points and:

• [30, 42, 65] Composite squarefree numbers where when you take the sum of prime factors and write it in english, at least 1/3 of the letters in the word are "e"
  
• [9, 17, 69, 77] {
  n ≡ 1 (mod 4) ∧ n ≥ 7 (mod 10)
  } Numbers congruent to 1 mod 4 whose last digit, written in english, can have the letters "ty" appended to the end of it to multiply it by ten (e.g., "six" times ten is "sixty", but "fourty" is not a number, so the last digit cannot be four)
  
• [5, 6, 50, 125] Numbers such that if you take the number of letters in the english spelling and add that to the number, and then repeat that process a second time, the result is in the range 11-15 mod 50 (inclusive).
  
• [2, 3, 23, 56] Numbers where each pair of consecutive digits differ by exactly one

DeathRowKitty has 44 points and:

• [38, 82, 84] slots never touched by Ace, 5, or 9 in perfect out-shuffles of standard 52 card decks, mod 52
  
• [1, 31, 61] numbers relatively prime to 210

Felissan has 21 points and:

popsofctown has 14 points and is being replaced:

• [55, 58, 60] {
  n, k, c st n is composite; k - c is perfect; c|n; k = max(d) st d|n ∧d ≠ n
  } composite number whose greatest non-trivial divisor minus any of its other divisors is a perfect number
  
• [30, 40, 55, 75] {
  25 + (5n * (n + 1) / 2)
  } 25 + 5n, where n is a triangular number

StrangerCoug has 14 points and:

• [5, 7, 10, 14] {
  n*(n-1)/2) + 4
  } triangular numbers + 4
  
• [4, 20, 36, 52, 68] {
  16n + 4
  } remainder is 4 when dividing by 16

There are 23 cards left in the deck. It is Felissan's turn.

[Felissan]

/out
Once again, really sorry that I couldn't keep playing all the way. Have fun with the rest of it! <3

[Plotinus]

Sorry to see you go and hope things get better for you.

[StrangerCoug]

[28, 36, 50, 93]: Numbers with exactly two distinct prime factors

28 = 2² × 7
36 = 2² × 3²
50 = 2 × 5²
93 = 3 × 31

[Plotinus]

Spoiler: Finished sequences:

• [5, 9, 10, 27, 48, 66, 98] {
  n² ± [0, 2]
  } numbers within 2 of a perfect square,
  
• [13, 15, 51, 53, 55, 73, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 0
  } numbers with at least two digits, all of which are odd
  
• [10, 21, 23, 45, 46, 59, 70] {
  n is 0 or odd (mod 9)
  } numbers that are odd when you repeatedly sum their digits
  
• [6, 7, 8, 13, 18, 20, 24, 34, 40] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.
  
• [12, 20, 35, 62, 85, 95, 100] numbers that are the sum of the proper divisors of some number < 1000 not in the deck for this game.
  
• [11, 17, 19, 29, 43, 71, 83] primes
  
• [5, 6, 13, 15, 16, 27, 100] numbers used in 0, including substrings of other numbers, but not including the deck spoiler
  
• [10, 21, 56, 57, 64, 76, 729] integers n for which there exists some integer m such that (n-1)/3^m and (n-2)/3^m are each endpoints of intervals removed during (possibly different) steps of the usual construction of the Cantor set (i.e. the construction in which each step removes the middle third of intervals existing after the previous step)
  
• [1, 10, 15, 28, 36, 78, 120] {
  n*(n-1)/2)
  }: triangular numbers
  
• [1, 4, 9, 16, 25, 64, 81] {
  n²
  } squares
  
• [7, 8, 9, 25, 37, 47, 49] {
  p^k | p^k < 50, prime p, k > 0
  }
  \
  {
  19, 27
  } numbers less than 50 with exactly 1 prime factor
  
• [12, 15, 19, 34, 35, 45, 49] 2 digit numbers with increasing digits
  
• [7, 14, 35, 42, 56, 63, 343] {
  7n
  } divisible by 7
  
• [8, 18, 29, 79, 87, 92, 96] {
  maxdigit(n) > 7
  } numbers that contain an 8 or 9
  
• [3, 4, 5, 7, 21, 22, 64] the nth prime doesn't have any even digits
  
• [1, 3, 6, 26, 54, 80, 220] numbers n for which there exists some positive integer with exactly 2n primitive roots
  
• [4, 13, 18, 27, 72, 88, 97] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with Σ_i∈[0,d]a_i = k^2 | a_i ≥ 0, d > 0, k ∈ ℤ
  } numbers whose digit sum is a square
  
• [3, 21, 24, 33, 39, 84, 165] {
  3n
  } multiples of 3
  
• [1, 2, 4, 16, 32, 64, 256] {
  2ⁿ
  } powers of two

Implosion has 42 points and:

• [30, 42, 65] Composite squarefree numbers where when you take the sum of prime factors and write it in english, at least 1/3 of the letters in the word are "e"
  
• [9, 17, 69, 77] {
  n ≡ 1 (mod 4) ∧ n ≥ 7 (mod 10)
  } Numbers congruent to 1 mod 4 whose last digit, written in english, can have the letters "ty" appended to the end of it to multiply it by ten (e.g., "six" times ten is "sixty", but "fourty" is not a number, so the last digit cannot be four)
  
• [5, 6, 50, 125] Numbers such that if you take the number of letters in the english spelling and add that to the number, and then repeat that process a second time, the result is in the range 11-15 mod 50 (inclusive).
  
• [2, 3, 23, 56] Numbers where each pair of consecutive digits differ by exactly one

DeathRowKitty has 44 points and:

• [38, 82, 84] slots never touched by Ace, 5, or 9 in perfect out-shuffles of standard 52 card decks, mod 52
  
• [1, 31, 61] numbers relatively prime to 210

Felissan has 21 points and:

popsofctown has 14 points and is being replaced:

• [55, 58, 60] {
  n, k, c st n is composite; k - c is perfect; c|n; k = max(d) st d|n ∧d ≠ n
  } composite number whose greatest non-trivial divisor minus any of its other divisors is a perfect number
  
• [30, 40, 55, 75] {
  25 + (5n * (n + 1) / 2)
  } 25 + 5n, where n is a triangular number

StrangerCoug has 14 points and:

• [5, 7, 10, 14] {
  n*(n-1)/2) + 4
  } triangular numbers + 4
  
• [4, 20, 36, 52, 68] {
  16n + 4
  } remainder is 4 when dividing by 16
  
• [28, 36, 50, 93] numbers with exactly 2 distinct prime factors

There are 19 cards left in the deck. It is implosion's turn.

[implosion]

32, 89, and 8 to finish my consecutive digits sequence