id:A102210 - OEIS Search Results

Search: id:A102210

Displaying 1-1 of 1 results found.

page 1

Number of primes that are bitwise covered by n.

+0
5

0, 1, 2, 0, 1, 1, 4, 0, 0, 1, 3, 0, 2, 1, 6, 0, 1, 1, 4, 0, 2, 1, 7, 0, 1, 1, 5, 0, 4, 1, 11, 0, 0, 1, 2, 0, 2, 1, 5, 0, 1, 1, 5, 0, 4, 1, 10, 0, 1, 1, 4, 0, 4, 1, 9, 0, 2, 1, 8, 0, 8, 1, 18, 0, 0, 1, 3, 0, 1, 1, 6, 0, 1, 1, 5, 0, 3, 1, 10, 0, 1, 1, 6, 0, 2, 1, 10, 0, 3, 1, 9, 0, 6, 1, 17, 0, 1, 1, 4, 0, 4, 1 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`p is bitwise covered by n iff (p = (n AND p)) bitwise: A080099(n,p)=p.` `a(A102211(n)) = 0; a(A102212(n)) = 1; a(A102213(n)) > 1.`
	LINKS	`Index entries for sequences related to binary expansion of n`
	EXAMPLE	`n=21->10101 -> a(21) = #{00101=5,10001=17} = 2.`
	CROSSREFS	`Cf. A007088, A004676.` `Cf. A102550.` `Sequence in context: A035788 A097559 A123226 this_sequence A124220 A110298 A144740` `Adjacent sequences: A102207 A102208 A102209 this_sequence A102211 A102212 A102213`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 30 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research