login
a(n) = the least integer k such that (1+1/n)^k >= 3.
1

%I #9 Apr 24 2014 06:09:27

%S 2,3,4,5,7,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,26,27,29,

%T 30,31,32,33,34,35,36,37,38,39,41,42,43,44,45,46,47,48,49,50,52,53,54,

%U 55,56,57,58,59,60,61,63,64,65,66,67,68,69,70,71,72,74,75

%N a(n) = the least integer k such that (1+1/n)^k >= 3.

%C Sequence of first differences consists just of 1's and 2's, no two consecutive 2's.

%C a(n)-A175406(n) may be arbitrarily large.

%H Vincenzo Librandi, <a href="/A175407/b175407.txt">Table of n, a(n) for n = 1..2000</a>

%t Table[Ceiling[Log[(1+1/n),3]],{n,200}]

%Y Cf. A175406.

%K nonn

%O 1,1

%A _Zak Seidov_, May 01 2010

%E Terms corrected by _Jon E. Schoenfield_, Apr 23 2014