The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A063529 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

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.
(history; published version)

#11 by Michael De Vlieger at Sat Apr 13 14:55:30 EDT 2024

STATUS

reviewed

approved

#10 by Michel Marcus at Sat Apr 13 14:54:34 EDT 2024

STATUS

proposed

reviewed

#9 by Jon E. Schoenfield at Sat Apr 13 12:42:18 EDT 2024

STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sat Apr 13 12:42:16 EDT 2024

NAME

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.

STATUS

approved

editing

#7 by N. J. A. Sloane at Fri Dec 15 17:35:23 EST 2017

AUTHOR

_Jason Earls (zevi_35711(AT)yahoo.com), _, Aug 01 2001

Discussion

Fri Dec 15

17:35

OEIS Server: https://oeis.org/edit/global/2722

#6 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

NAME

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.

KEYWORD

easy,nonn,new

#5 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009

KEYWORD

easy,nonn,new

AUTHOR

Jason Earls (jcearlszevi_35711(AT)cableoneyahoo.netcom), Aug 01 2001

#4 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004

KEYWORD

easy,nonn,new

AUTHOR

Jason Earls (jcearls(AT)4grccableone.comnet), Aug 01 2001

#3 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

KEYWORD

easy,nonn,new

AUTHOR

Jason Earls (jcearls(AT)kskc4grc.netcom), Aug 01 2001

#2 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004

PROG

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

KEYWORD

easy,nonn,new