login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035100 Number of bits in binary expansion of n-th prime. 20
2, 2, 3, 3, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Jamie Morken, Table of n, a(n) for n = 1..10000 (first 1000 terms from G. C. Greubel)

MAPLE

Digits := 40: [ seq(1+floor(evalf(log(ithprime(n))/log(2))), n=1..100) ];

MATHEMATICA

f[n_]:=Length[IntegerDigits[Prime[n], 2]]; Table[f[n], {n, 5!}] (* Vladimir Joseph Stephan Orlovsky, Feb 07 2010 *)

PROG

(PARI) a(n)=#binary(prime(n)) \\ Charles R Greathouse IV, Sep 23 2012

CROSSREFS

Cf. A000040, A000523, A029837, A070939, A162145.

Sequence in context: A260254 A337853 A282711 * A303594 A085089 A228720

Adjacent sequences:  A035097 A035098 A035099 * A035101 A035102 A035103

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)