id:A095057 - OEIS Search Results

Search: id:A095057

Displaying 1-1 of 1 results found.

page 1

Number of primes with four 1-bits (A095077) in range ]2^n,2^(n+1)].

+0
2

0, 0, 0, 2, 2, 5, 4, 10, 6, 13, 11, 9, 16, 16, 18, 25, 15, 19, 15, 37, 17, 37, 29, 29, 32, 40, 23, 49, 31, 51, 39, 37, 30, 52, 46, 40, 42, 62, 43, 57, 42, 68, 52, 78, 60, 89, 54, 63, 59, 92, 58, 79, 82, 99, 73, 87, 47, 99, 74, 72, 81, 106, 56, 102, 85, 117, 85, 97, 64, 132, 93 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..200` `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)]` `Samuel S. Wagstaff, Jr., Prime Numbers with a fixed number of one bits or zero bits in their binary representation, Exp. Math. vol. 10, issue 2 (2001) 267, Table 2.`
	CROSSREFS	`Cf. A095018.` `Sequence in context: A091726 A091769 A034402 this_sequence A056439 A056444 A112472` `Adjacent sequences: A095054 A095055 A095056 this_sequence A095058 A095059 A095060`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 01 2004`
	EXTENSIONS	`More terms from T. D. Noe (noe(AT)sspectra.com), Oct 17 2007`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research