A033921 - OEIS

This site is supported by donations to The OEIS Foundation.

A033921

Largest proper substring of 2^n that is a power of 2 (0 if none).

0, 0, 0, 0, 1, 2, 4, 8, 2, 2, 4, 8, 4, 8, 16, 32, 0, 2, 4, 8, 8, 2, 4, 8, 16, 32, 64, 8, 8, 8, 8, 64, 4, 8, 8, 8, 8, 8, 8, 8, 16, 32, 8, 8, 16, 32, 64, 32, 8, 4, 8, 8, 4, 4, 8, 8, 4, 8, 8, 64, 8, 8, 16, 8, 16, 32, 64, 64, 8, 8, 16, 32, 64, 32, 8, 16, 32, 64, 4, 8, 8, 16, 32, 64, 16, 32, 64, 8, 8 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,6`
	EXAMPLE	`2^15={32}768, so a(15)=32.`
	CROSSREFS	`Sequence in context: A097892 A197282 A175131 * A167420 A195711 A200610` `Adjacent sequences: A033918 A033919 A033920 * A033922 A033923 A033924`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1998.`

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

Last modified February 13 20:14 EST 2012. Contains 205553 sequences.