A061717 -id:A061717 - cp's OEIS frontend

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

0, 2, 3, 8, 10, 12, 14, 24, 27, 30, 33, 36, 39, 42, 45, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275, 280, 285, 290

Offset: 1

Alois P. Heinz, Jan 03 2021

nonn

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

Cf. A000523, A061717, A326299, A336018.

Maple
```
a:= n-> n*ilog2(n):
seq(a(n), n=1..60);
```

a(n) = n * A000523(n).

a(n) = A326299(n) - A336018(n).

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

Original entry on oeis.org

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

Michel Marcus, Oct 17 2019

nonn

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.

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

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

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

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

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Formula