id:A064894 - OEIS Search Results

Search: id:A064894

Displaying 1-1 of 1 results found.

page 1

Binary dilution of n. GCD of exponents in binary expansion of n.

+0
4

0, 0, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 6, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`All bits of n in positions not divisible by a(n) are zero. Hence n in binary contains blocks of a(n)-1 "diluting" 0's (for n>1). Also for n>1, a(2^n) = a(2^n + 1) = n. For i,j odd, a(ij) = GCD(a(i),a(j)).`
	FORMULA	`If n = 2^e0 + 2^e1 +... then a(n) = GCD(e0, e1, ...).`
	EXAMPLE	`577 = 2^0 + 2^6 + 2^9, GCD(0,6,9) = 3 = a(577)`
	CROSSREFS	`A000079, A064895.` `a(A064896(n)) = A056538(n)` `Sequence in context: A057431 A057060 A152805 this_sequence A003638 A094267 A136480` `Adjacent sequences: A064891 A064892 A064893 this_sequence A064895 A064896 A064897`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Oct 11 2001`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research