login
A063529
a(n) = 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
OFFSET
1,5
PROG
(PARI) j=[]; for(n=1, 150, j=concat(j, if(isprime(2^n-1), floor(log(2^n-1)), ))); j
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Aug 01 2001
STATUS
approved