id:A092323 - OEIS Search Results

Search: id:A092323

Displaying 1-1 of 1 results found.

page 1

2^m - 1 appears 2^m times.

+0
1

0, 1, 1, 3, 3, 3, 3, 7, 7, 7, 7, 7, 7, 7, 7, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Or, write n in binary and change the most significant bit to 0 and all other bits to 1.` `a(n) = A053644(n) - 1 = A003817(n) - A053644(n).`
	FORMULA	`a(n) = if n=1 then 0 else a(floor(n/2))*2 + 1.`
	CROSSREFS	`Sequence in context: A006166 A142716 A079084 this_sequence A092531 A125002 A098528` `Adjacent sequences: A092320 A092321 A092322 this_sequence A092324 A092325 A092326`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 15 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research