id:A143069 - OEIS Search Results

Search: id:A143069

Displaying 1-1 of 1 results found.

page 1

Least number k such that n*k has the fewest possible ones in its binary expansion.

+0
3

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, 1, 27, 1, 1, 3, 3, 1, 41, 5, 19, 1, 565, 1, 1, 1, 1, 1, 1, 1, 7085, 27, 7, 1, 25, 1, 3, 3, 1, 3, 11, 1, 1, 41, 1, 5, 1266205, 19, 7, 1, 9, 565, 9099507, 1, 17602325, 1, 1, 1, 1, 1, 128207979, 1, 1, 1, 119, 1, 1, 7085, 1, 27, 5, 7, 13 (list; graph; listen)

	OFFSET	`1,11`
	COMMENT	`a(n)=1 indicates that n is a sturdy number (A125121); that is, no multiple of n has fewer ones than the binary expansion of n. A086342(n) gives the least possible number of ones in the binary expansion of a multiple of n. Compare with A143073.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A143315 A120444 A094919 this_sequence A010286 A002945 A093423` `Adjacent sequences: A143066 A143067 A143068 this_sequence A143070 A143071 A143072`
	KEYWORD	`nonn`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Jul 22 2008`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research