id:A064895 - OEIS Search Results

Search: id:A064895

Displaying 1-1 of 1 results found.

page 1

Binary concentration of n. Replace 2^e_k with 2^(e_k/g(n)) in binary expansion of n, where g(n) = GCD of exponents e_k = A064894(n).

+0
2

0, 1, 2, 3, 2, 3, 6, 7, 2, 3, 10, 11, 12, 13, 14, 15, 2, 3, 18, 19, 6, 7, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 2, 3, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 2, 3, 66, 67, 10, 11, 70, 71, 6, 7, 74, 75 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`If n = 2^(g(n)e0) + 2^(g(n)e1) +... then a(n) = 2^e0 + 2^e1 +...`
	EXAMPLE	`577 = 2^0 + 2^6 + 2^9, GCD(0,6,9) = 3, a(577) = 2^(0/3)+2^(6/3)+2^(9/3) = 13.`
	CROSSREFS	`A000079, A064894.` `Sequence in context: A085212 A079025 A165930 this_sequence A120877 A089135 A038063` `Adjacent sequences: A064892 A064893 A064894 this_sequence A064896 A064897 A064898`
	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