A136510 - OEIS

This site is supported by donations to The OEIS Foundation.

A136510

Smallest k>1 such that in binary representation n is contained in n^k.

2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 3, 6, 3, 6, 5, 3, 3, 5, 5, 2, 3, 3, 3, 3, 2, 3, 3, 6, 3, 8, 6, 3, 3, 2, 9, 4, 5, 6, 5, 5, 3, 5, 5, 4, 5, 6, 2, 5, 3, 5, 3, 6, 3, 6, 3, 3, 2, 3, 3, 6, 3, 7, 6, 10, 3, 9, 11, 5, 7, 8, 4, 5, 3, 9, 2, 8, 9, 7, 4, 6, 5, 6, 6, 3, 5, 5, 5, 5, 3, 5, 5, 3, 5, 9, 11, 7, 5 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`A136511(n) = n^a(n);` `a(A018826(n)) = 2; 1 < a(A136490(n)) <= 3;` `conjecture: a(n) is defined for all n.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..1000` `Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Sequence in context: A197775 A100198 A164996 * A080071 A202472 A019569` `Adjacent sequences: A136507 A136508 A136509 * A136511 A136512 A136513`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.