id:A113474 - OEIS Search Results

Search: id:A113474

Displaying 1-1 of 1 results found.

page 1

a(n) = a(floor(n/2)) + floor(n/2) with a(1) = 1.

+0
2

1, 2, 2, 4, 4, 5, 5, 8, 8, 9, 9, 11, 11, 12, 12, 16, 16, 17, 17, 19, 19, 20, 20, 23, 23, 24, 24, 26, 26, 27, 27, 32, 32, 33, 33, 35, 35, 36, 36, 39, 39, 40, 40, 42, 42, 43, 43, 47, 47, 48, 48, 50, 50, 51, 51, 54, 54, 55, 55, 57, 57, 58, 58, 64, 64, 65, 65, 67, 67, 68, 68, 71, 71 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(2^n)=2^n, in other cases a(n) < n; except for the first one all entries are repeated twice; apparently no simple formula for a(n).`
	FORMULA	`a(n)=sum{k=0..n, floor(n/2^k)}-n+1; a(n)=2+sum{k=0..n, floor(n/2^k)-1}; a(n)=A005187(n)-n+1; - Paul Barry (pbarry(AT)wit.ie), Aug 27 2006`
	MATHEMATICA	`a[1]=1; a[n_]:=a[n]=a[Floor[n/2]]+Floor[n/2]; Table[a[n], {n, 100}]`
	CROSSREFS	`Adjacent sequences: A113471 A113472 A113473 this_sequence A113475 A113476 A113477` `Sequence in context: A116648 A036714 A035644 this_sequence A089413 A127311 A129229`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Jan 08 2006`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research