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!)
A086845 a(1) = 0, a(n) = a(floor(n/2)) + 2*a(ceiling(n/2)) + floor(n/2). 0
0, 1, 3, 5, 9, 12, 16, 19, 27, 32, 38, 42, 50, 55, 61, 65, 81, 90, 100, 106, 118, 125, 133, 138, 154, 163, 173, 179, 191, 198, 206, 211, 243, 260, 278, 288, 308, 319, 331, 338, 362, 375, 389, 397, 413, 422, 432, 438, 470, 487, 505, 515, 535 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Number of comparators used in Bose-Nelson networks.

LINKS

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

R. C. Bose and R. J. Nelson, A sorting problem, J. Assoc. Comput. Mach. 9 (1962), 282-296.

P. J. Grabner and H.-K. Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence, Constructive Approximation, Jan. 2005, Volume 21, Issue 2, pp 149-179.

PROG

(PARI) a(n)=if(n<2, 0, a(floor(n/2))+2*a(ceil(n/2))+floor(n/2))

(MAGMA) [n le 1 select 0 else Self(Floor(n/2)) + 2*Self(Ceiling(n/2)) + Floor(n/2): n in [1..60]]; // Vincenzo Librandi, Aug 30 2016

CROSSREFS

Cf. A064194.

Sequence in context: A003075 A061562 A006282 * A243205 A259368 A175098

Adjacent sequences:  A086842 A086843 A086844 * A086846 A086847 A086848

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan, Aug 09 2003

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 July 24 21:47 EDT 2021. Contains 346273 sequences. (Running on oeis4.)