id:A037888 - OEIS Search Results

Search: id:A037888

Displaying 1-1 of 1 results found.

page 1

a(n)=(1/2)*Sum{|d(i)-e(i)|} where Sum{d(i)*2^i} is base 2 representation of n and e(i) are digits d(i) in reverse order.

+0
11

0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 2, 1, 1, 0, 2, 1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 1, 0, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 1, 0, 2, 1, 2, 1, 3 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`a(n)=least number of digits for which the change 0->1 in (binary n) yields a palindrome.`
	CROSSREFS	`Sequence in context: A059782 A093654 A039924 this_sequence A052308 A116510 A128915` `Adjacent sequences: A037885 A037886 A037887 this_sequence A037889 A037890 A037891`
	KEYWORD	`nonn,base,nice`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research