|
%I #19 Aug 07 2015 15:47:49
%S 0,1,2,2,3,4,4,5,6,6,7,7,8,9,9,10,11,11,12,12,13,14,14,15,16,16,17,18,
%T 18,19,19,20,21,21,22,23,23,24,24,25,26,26,27,28,28,29,30,30,31,31,32,
%U 33,33,34,35,35,36,36,37,38,38,39,40,40,41,42,42,43,43,44,45,45,46,47
%N a(n) = ceiling( n * (log_3 2)) = ceiling(n * 0.6309297535714574371...).
%H Reinhard Zumkeller, <a href="/A156301/b156301.txt">Table of n, a(n) for n = 0..10000</a>
%H Li an-Ping, <a href="http://arxiv.org/abs/0902.0841">A note on the counterfeit coins problem</a>, Feb 7, 2009.
%p seq(ceil(n*log[3](2)),n=0..120) ; # _R. J. Mathar_, Mar 14 2009
%t With[{c=Log[3,2]},Ceiling[c*Range[0,80]]] (* _Harvey P. Dale_, Aug 07 2015 *)
%o (Haskell)
%o a156301 = ceiling . (* logBase 3 2) . fromIntegral
%o -- _Reinhard Zumkeller_, Jul 03 2015
%Y Cf. A020915, A102525. - _R. J. Mathar_, Feb 19 2009
%Y Cf. A136409.
%K easy,nonn
%O 0,3
%A _Jonathan Vos Post_, Feb 07 2009
%E More terms from _R. J. Mathar_, Mar 14 2009
%E Edited by _N. J. A. Sloane_, May 23 2009 at the suggestion of _Hagen von Eitzen_
|
