A102550 - OEIS

This site is supported by donations to The OEIS Foundation.

A102550

Number of distinct prime-factors of n that are bitwise covered by n.

0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 2, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 2, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 1, 0, 1, 1, 0, 0, 0, 1, 2, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,15`
	COMMENTS	`p is bitwise covered by n iff (p = (n AND p)) bitwise: A080099(n,p)=p.` `a(A102553(n))=A001221(A102553(n)), a(A102554(n)) < A001221(A102554(n));` `a(A102551(n)) = 0, a(A102551(n)) > 0;` `a(A102555(n))=n and a(m)<n for m < A102555(n).`
	LINKS	`Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Cf. A102210, A007088, A004676.` `Sequence in context: A178498 A095408 A133008 * A116929 A059984 A046675` `Adjacent sequences: A102547 A102548 A102549 * A102551 A102552 A102553`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 14 2005`

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

Last modified February 17 23:57 EST 2012. Contains 206085 sequences.