|
%I #14 Nov 29 2022 12:29:37
%S 0,2,4,8,11,15,19,24,28,33,38,43,48,53,58,64,69,75,80,86,92,98,104,
%T 110,116,122,128,134,140,147,153,160,166,172,179,186,192,199,206,212,
%U 219,226,233,240,247,254,261,268,275,282,289,296,303,310,317,325,332,339,347,354
%N a(n) = floor(n*log_2(n)).
%H Alois P. Heinz, <a href="/A326299/b326299.txt">Table of n, a(n) for n = 1..10000</a>
%H Sandor Csörgö, Gordon Simons, <a href="http://www.math.uni.wroc.pl/~pms/files/14.2/Abstract/14.2.1.abs.pdf">On Steinhaus' resolution of the St. Petersburg paradox</a>, Probab. Math. Statist. 14 (1993), 157--172. MR1321758 (96b:60017). See Table 1 p. 171.
%p a:= n-> floor(n*log[2](n)):
%p seq(a(n), n=1..80); # _Alois P. Heinz_, Oct 17 2019
%t Table[Floor[n Log2[n]],{n,80}] (* _Harvey P. Dale_, Nov 29 2022 *)
%o (PARI) a(n) = n*log(n)\log(2);
%Y Cf. A000523 (log_2(n)), A061717, A340301.
%K nonn
%O 1,2
%A _Michel Marcus_, Oct 17 2019
|
