id:A086063 - OEIS Search Results

Search: id:A086063

Displaying 1-1 of 1 results found.

page 1

a(n) = if n<=1 then 1 else smallest k>1 such that in binary representation n is contained in n^k.

+0
2

1, 1, 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 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A094543(n) = n^a(n).`
	EXAMPLE	`n=6: 6='110' is not contained in 6^2='100100', but in 6^3='11011000', therefore a(6)=3.`
	CROSSREFS	`Cf. A045537, A007088.` `Sequence in context: A124474 A076982 A091935 this_sequence A026263 A080098 A083060` `Adjacent sequences: A086060 A086061 A086062 this_sequence A086064 A086065 A086066`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Aug 24 2003`
	EXTENSIONS	`Extended and corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 08 2004`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research