id:A102550 - OEIS Search Results

Search: id:A102550

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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; listen)

	OFFSET	`0,15`
	COMMENT	`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: A075107 A095408 A133008 this_sequence A116929 A059984 A046675` `Adjacent sequences: A102547 A102548 A102549 this_sequence A102551 A102552 A102553`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 14 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research