A377206 a(n) = ceiling(log(1/n)/log(1 - 1/n)).

1, 3, 5, 8, 10, 13, 16, 19, 22, 26, 29, 33, 36, 40, 43, 47, 51, 55, 59, 63, 67, 71, 75, 79, 84, 88, 92, 96, 101, 105, 110, 114, 119, 123, 128, 132, 137, 142, 146, 151, 156, 160, 165, 170, 175, 180, 184, 189, 194, 199, 204, 209, 214, 219, 224, 229, 234

Offset: 2

Author

Walter Robinson, Oct 19 2024

Keywords

• easy
• nonn

Comments

This sequence also describes the minimum number of n-player games, where each player has an equal chance of winning, that must be played for a given player to have an equal or greater chance of winning at least once than they have of losing a single game.

Crossrefs

Cf. A031435, A094500.

Programs

Mathematica

Table[Ceiling[Log[1/n]/Log[1-1/n]], {n,2,58}] (* James C. McMahon, Nov 04 2024 *)

Formula

a(n) = A031435(n-1) + 1 for n >= 3.