Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Oct 10 2017 10:32:00
%S 1,2,3,5,10,19,37,74,148,296,592,1183,2365,4730,9460,18919,37838,
%T 75675,151349,302698,605396,1210792,2421583,4843166,9686331,19372661,
%U 38745321,77490642,154981283,309962566,619925132,1239850263,2479700525,4959401050,9918802099
%N Least integer k such that k/2^n > sqrt(1/3).
%H Clark Kimberling, <a href="/A293328/b293328.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = ceiling(r*2^n), where r = sqrt(1/3).
%F a(n) = A293327(n) + 1.
%t z = 120; r = Sqrt[1/3];
%t Table[Floor[r*2^n], {n, 0, z}]; (* A293327 *)
%t Table[Ceiling[r*2^n], {n, 0, z}]; (* A293328 *)
%t Table[Round[r*2^n], {n, 0, z}]; (* A293329 *)
%Y Cf. A002194, A094386, A293327, A293329.
%K nonn,easy
%O 0,2
%A _Clark Kimberling_, Oct 10 2017