id:A092111 - OEIS Search Results

Search: id:A092111

Displaying 1-1 of 1 results found.

page 1

n+1 less the greatest number of 1's in binary representations of primes between 2^n and 2^(n+1).

+0
2

0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,14`
	COMMENT	`0's occur only at Mersenne prime exponents (A000043) -1, twos are in A092112, threes do not appear < 504.`
	FORMULA	`n+1 - A091937.`
	MATHEMATICA	`Compute the second line of the Mathematica code for A091938, then (Table[n + 1, {n, 105}]) - (Count[ IntegerDigits[ #, 2], 1] & /@ Table[ f[n], {n, 105}])`
	CROSSREFS	`Cf. A091938, A092112.` `Sequence in context: A073368 A037889 A098055 this_sequence A050317 A141095 A159195` `Adjacent sequences: A092108 A092109 A092110 this_sequence A092112 A092113 A092114`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 20 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research