The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A276133

Exponent of highest power of 2 dividing the product of the composite numbers between the n-th prime and the (n+1)-st prime.
(history; published version)

#62 by Harvey P. Dale at Mon Aug 12 19:26:27 EDT 2024

STATUS

editing

approved

#61 by Harvey P. Dale at Mon Aug 12 19:26:24 EDT 2024

MATHEMATICA

IntegerExponent[#, 2]&/@(Times@@Range[#[[1]]+1, #[[2]]-1]&/@Partition[ Prime[ Range[ 80]], 2, 1]) (* Harvey P. Dale, Aug 12 2024 *)

STATUS

approved

editing

#60 by Joerg Arndt at Mon Jul 11 02:09:03 EDT 2022

STATUS

editing

approved

#59 by Joerg Arndt at Mon Jul 11 02:09:01 EDT 2022

NAME

Exponent of highest power of 2 dividing the product of the composite numbers between the n-th prime and the (n+1)-st prime.

#58 by Joerg Arndt at Mon Jul 11 02:08:36 EDT 2022

NAME

Exponent of highest power of 2 dividing the product of composite numbers between the n-th prime and the (n+1)-st prime.

STATUS

reviewed

editing

#57 by Michel Marcus at Mon Jul 11 00:34:16 EDT 2022

STATUS

proposed

reviewed

#56 by Jon E. Schoenfield at Sun Jul 10 22:17:57 EDT 2022

STATUS

editing

proposed

#55 by Jon E. Schoenfield at Sun Jul 10 22:17:55 EDT 2022

PROG

(pythonPython)

STATUS

proposed

editing

#54 by Chai Wah Wu at Sun Jul 10 22:13:17 EDT 2022

STATUS

editing

proposed

#53 by Chai Wah Wu at Sun Jul 10 22:12:26 EDT 2022

PROG

(python)

from sympy import prime

def A276133(n): return (p:=prime(n+1)-1)-p.bit_count()-(q:=prime(n))+q.bit_count() # Chai Wah Wu, Jul 10 2022

STATUS

approved

editing