login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326299 a(n) = floor(n*log_2(n)). 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..60.

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

PROG

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

CROSSREFS

Cf. A000523 (log_2(n)).

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 07:24 EDT 2020. Contains 337178 sequences. (Running on oeis4.)