A326299 a(n) = floor(n*log_2(n)).

0, 2, 4, 8, 11, 15, 19, 24, 28, 33, 38, 43, 48, 53, 58, 64, 69, 75, 80, 86, 92, 98, 104, 110, 116, 122, 128, 134, 140, 147, 153, 160, 166, 172, 179, 186, 192, 199, 206, 212, 219, 226, 233, 240, 247, 254, 261, 268, 275, 282, 289, 296, 303, 310, 317, 325, 332, 339, 347, 354

Offset

1,2

Links

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Sandor Csörgö, Gordon Simons, On Steinhaus' resolution of the St. Petersburg paradox, Probab. Math. Statist. 14 (1993), 157--172. MR1321758 (96b:60017). See Table 1 p. 171.

Maple

a:= n-> floor(n*log[2](n)):
seq(a(n), n=1..80);  # Alois P. Heinz, Oct 17 2019

Mathematica

Table[Floor[n Log2[n]], {n, 80}] (* Harvey P. Dale, Nov 29 2022 *)

Prog

(PARI) a(n) = n*log(n)\log(2);

Crossrefs

Cf. A000523 (log_2(n)), A061717, A340301.

Sequence in context: A330331 A033153 A086790 * A320448 A115797 A336627

Adjacent sequences: A326296 A326297 A326298 * A326300 A326301 A326302

Keyword

nonn

Author

Michel Marcus, Oct 17 2019

Status

approved