This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A063529 #11 Apr 13 2024 14:55:30 %S A063529 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 A063529 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 A063529 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 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. %o A063529 (PARI) j=[]; for(n=1,150,j=concat(j, if(isprime(2^n-1),floor(log(2^n-1)),))); j %Y A063529 Cf. A029832, A029833, A053821, A062590, A029834, A000225. %K A063529 easy,nonn %O A063529 1,5 %A A063529 _Jason Earls_, Aug 01 2001