id:A140130 - OEIS Search Results

Search: id:A140130

Displaying 1-1 of 1 results found.

page 1

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;.

+0
3

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

	OFFSET	`1,5`
	COMMENT	`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	`Adjacent sequences: A140127 A140128 A140129 this_sequence A140131 A140132 A140133` `Sequence in context: A131505 A100092 A131508 this_sequence A125653 A104445 A000189`
	KEYWORD	`nonn,frac`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 14 2008`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research