id:A086845 - OEIS Search Results

Search: id:A086845

Displaying 1-1 of 1 results found.

page 1

a(1) = 0, a(n) = a([n/2]) + 2a(ceil(n/2)) + [n/2].

+0
1

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; listen)

	OFFSET	`1,3`
	COMMENT	`Number of comparators used in Bose-Nelson networks.`
	REFERENCES	`R. C. Bose and R. J. Nelson, A sorting problem, J. Assoc. Comput. Mach. 9 (1962), 282-296.`
	LINKS	`P. J. Grabner and H.-K. Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence`
	PROGRAM	`(PARI) a(n)=if(n<2, 0, a(floor(n/2))+2*a(ceil(n/2))+floor(n/2))`
	CROSSREFS	`Cf. A064194.` `Sequence in context: A003075 A061562 A006282 this_sequence A127722 A060419 A005766` `Adjacent sequences: A086842 A086843 A086844 this_sequence A086846 A086847 A086848`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 09 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research