68468401

Appears in sequences

• If n good guys followed by n bad guys stand in a circle, a(n) is the least q such that executing every q-th person gets all bad guys first.at n=15A343780
• a(n) is the smallest integer k > 1 that satisfies k mod j <= 1 for all integers j in 1..n.at n=22A361246
• a(n) is the smallest integer k > 1 that satisfies k mod j <= 1 for all integers j in 1..n.at n=23A361246
• a(n) is the smallest integer k > 1 that satisfies k mod j <= 1 for all integers j in 1..n.at n=24A361246
• a(n) is the smallest integer k > 1 that satisfies k mod j <= 1 for all integers j in 1..n.at n=25A361246