login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326300 Steinhaus sums. 0

%I #10 Oct 18 2019 16:51:40

%S 2,6,8,16,18,22,24,40,42,46,48,56,58,62,64,96,98,102,104,112,114,118,

%T 120,136,138,142,144,152,154,158,160,224,226,230,232,240,242,246,248,

%U 264,266,270,272,280,282,286,288,320,322,326,328,336,338,342,344,360,362,366,368

%N Steinhaus sums.

%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 p. 163 and Table 1 p. 171.

%F a(n) = Sum_{k>=1} floor(n/2^k + 1/2)*2^k.

%F a(n) = 2 * A006520(n-1).

%o (PARI) a(n) = sum(k=1, 1+log(n)\log(2), floor(n/2^k+1/2)*2^k);

%Y Cf. A000523 (log_2(n)), A006520.

%K nonn

%O 1,1

%A _Michel Marcus_, Oct 17 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)