This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091935 Smallest number of 1's in binary representations of primes between 2^n and 2^(n+1). 4
 1, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = A000120(A091936(n)). 0 never appears, 1 appears only at 1, 2's appear only for Fermat primes (A019434), 4's appear at A092100. I have found no fives <= 250. - Robert G. Wilson v LINKS MATHEMATICA Run the second Mathematica line of A091936, then Join[{1}, Count[ IntegerDigits[ #, 2], 1] & /@ Table[ f[n], {n, 2, 105}]] (* Robert G. Wilson v, Feb 19 2004 *) CROSSREFS Cf. A091937, A092100. Sequence in context: A076982 A283617 A164886 * A086063 A145653 A266119 Adjacent sequences:  A091932 A091933 A091934 * A091936 A091937 A091938 KEYWORD nonn AUTHOR Reinhard Zumkeller, Feb 14 2004 EXTENSIONS More terms from Robert G. Wilson v, Feb 18 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 07:06 EDT 2019. Contains 324203 sequences. (Running on oeis4.)