login
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

%I #11 Apr 13 2024 14:55:30

%S 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,

%T 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,

%U 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

%N 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.

%o (PARI) j=[]; for(n=1,150,j=concat(j, if(isprime(2^n-1),floor(log(2^n-1)),))); j

%Y Cf. A029832, A029833, A053821, A062590, A029834, A000225.

%K easy,nonn

%O 1,5

%A _Jason Earls_, Aug 01 2001