This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063529 M[2^n-1], where M[] is A029834, a discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0 and 2^n-1 is A000225. 0
 0, 1, 1, 0, 3, 0, 4, 0, 0, 0, 0, 0, 9, 0, 0, 0, 11, 0, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS PROG (PARI) j=[]; for(n=1, 150, j=concat(j, if(isprime(2^n-1), floor(log(2^n-1)), ))); j CROSSREFS Cf. A029832, A029833, A053821, A062590, A029834, A000225. Sequence in context: A272722 A229694 A033596 * A136667 A004588 A272474 Adjacent sequences:  A063526 A063527 A063528 * A063530 A063531 A063532 KEYWORD easy,nonn AUTHOR Jason Earls, Aug 01 2001 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 September 16 18:24 EDT 2019. Contains 327116 sequences. (Running on oeis4.)