A095055 - OEIS

This site is supported by donations to The OEIS Foundation.

A095055

Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].

0, 0, 0, 1, 2, 3, 7, 11, 27, 40, 80, 130, 343, 482, 1180, 1756, 4473, 6479, 15387, 24022, 58714, 89306, 213397, 335115, 802311, 1265350, 2965114, 4781514, 11185644, 18079040, 42048314, 68709969, 159433693 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,5`
	LINKS	`A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence` `Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]`
	CROSSREFS	`a(n) = A095019(n) + (if n is odd) A095018((n+1)/2).` `Sequence in context: A112843 A036651 A049454 * A107857 A107858 A143926` `Adjacent sequences: A095052 A095053 A095054 * A095056 A095057 A095058`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 01 2004`

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

Last modified February 14 16:42 EST 2012. Contains 205635 sequences.