login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276133 Exponent of highest power of 2 dividing product of composite numbers between n-th prime and (n+1)-st prime. 1
0, 2, 1, 4, 2, 5, 1, 3, 6, 1, 8, 4, 1, 3, 7, 6, 2, 8, 3, 3, 4, 5, 6, 9, 3, 1, 4, 2, 5, 11, 8, 6, 1, 10, 1, 6, 7, 3, 6, 6, 2, 8, 6, 3, 1, 12, 10, 6, 2, 4, 4, 4, 8, 11, 4, 6, 1, 7, 4, 1, 11, 13, 3, 3, 3, 15, 7, 8, 2, 6, 4, 7, 7, 5, 3, 10, 7, 5, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..79.

FORMULA

a(n) = A007814(A061214(n))

a(n+1) = Sum_{k = A000040(n+1)..A000040(n+2)} A007814(k)

PROG

(PARI) a(n) = valuation(prod(k=prime(n)+1, prime(n+1)-1, k), 2); \\ Michel Marcus, Aug 31 2016

CROSSREFS

Supersequence of A205649 (Hamming distance betweem twin primes).

Cf. A000040, A007814, A061214.

Sequence in context: A219432 A120988 A095979 * A054269 A086450 A270439

Adjacent sequences:  A276130 A276131 A276132 * A276134 A276135 A276136

KEYWORD

nonn,easy

AUTHOR

Juri-Stepan Gerasimov, Aug 29 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 17 18:28 EST 2018. Contains 297829 sequences.