This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A377206 #17 Nov 04 2024 20:38:15
%S A377206 1,3,5,8,10,13,16,19,22,26,29,33,36,40,43,47,51,55,59,63,67,71,75,79,
%T A377206 84,88,92,96,101,105,110,114,119,123,128,132,137,142,146,151,156,160,
%U A377206 165,170,175,180,184,189,194,199,204,209,214,219,224,229,234
%N A377206 a(n) = ceiling(log(1/n)/log(1 - 1/n)).
%C A377206 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.
%F A377206 a(n) = A031435(n-1) + 1 for n >= 3.
%t A377206 Table[Ceiling[Log[1/n]/Log[1-1/n]], {n,2,58}] (* _James C. McMahon_, Nov 04 2024 *)
%Y A377206 Cf. A031435, A094500.
%K A377206 easy,nonn
%O A377206 2,2
%A A377206 _Walter Robinson_, Oct 19 2024