A140130 - OEIS

This site is supported by donations to The OEIS Foundation.

A140130

a(n) = denominator of c(n) = if n=1 then 1 else if n < 3*2^[Log2(n)-1] then (c([n/2])+c([(n+1)/2]))/2 else c(n-2^[Log2(n)])+1;.

1, 1, 1, 1, 2, 1, 1, 1, 4, 2, 4, 1, 2, 1, 1, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 16, 8, 16, 4, 16, 8, 16, 2, 16, 8, 16, 4, 16, 8, 16, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16, 32, 8, 32, 16, 32, 2, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,5`
	COMMENTS	`a(n) = if n=1 then 1 else if n < 3*2^[Log2(n)-1] then (if n mod 2` `= 0 then a(n/2) else 2^[Log2(n)-1]) else a(n-[Log2(n)]);` `for n>1: A140130(A023758(n)) = 1.` `see A140129 for further comments and examples.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..8191`
	CROSSREFS	`Sequence in context: A131505 A100092 A131508 * A125653 A104445 A000189` `Adjacent sequences: A140127 A140128 A140129 * A140131 A140132 A140133`
	KEYWORD	`nonn,frac`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 14 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.