id:A165415 - OEIS Search Results

Search: id:A165415

Displaying 1-1 of 1 results found.

page 1

a(n) = the smallest positive integer that contains more digits written in binary than n has written in binary, and which does not contain binary n as a substring in its binary representation.

+0
1

7, 4, 10, 8, 8, 8, 18, 16, 16, 16, 16, 16, 16, 16, 34, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 66, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64 (list; graph; listen)

	OFFSET	`2,1`
	FORMULA	`a(2) = 7. For n >=2: a(2^n) = 2^(n+1) + 2; for m such that 2^(n-1)+1 <= m <= 2^n-1, a(m) = 2^n.`
	CROSSREFS	`Sequence in context: A138282 A155823 A103227 this_sequence A069199 A138339 A107827` `Adjacent sequences: A165412 A165413 A165414 this_sequence A165416 A165417 A165418`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Sep 17 2009`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research