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

0, 0, 1, 2, 1, 1, 2, 1, 4, 1, 3, 1, 1, 2, 2, 4, 1, 3, 1, 2, 2, 4, 2, 4, 2, 1, 1, 3, 1, 7, 1, 4, 1, 4, 1, 3, 5, 1, 3, 2, 2, 5, 1, 1, 2, 5, 6, 2, 1, 1, 3, 1, 7, 3, 3, 2, 3, 2, 2, 1, 4, 8, 1, 1, 2, 8, 3, 4, 1, 3, 2, 4, 3, 4, 1, 3, 4, 1, 6, 4, 1, 4, 3, 2, 2, 2, 4, 3, 1, 1, 6, 7, 1, 4, 1, 3, 6

Offset

1,4

Links

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

Formula

a(n) = A007949(A061214(n))

a(n + 2) = Sum_{k = A000040(n + 2)..A000040(n + 3} A007949(k)

Mathematica

Table[IntegerExponent[Times@@Range[Prime[n]+1, Prime[n+1]-1], 3], {n, 100}] (* Harvey P. Dale, Mar 23 2021 *)

Crossrefs

Cf. A007849, A061214, A276133.

Sequence in context: A137843 A130194 A113926 * A165585 A082506 A053000

Adjacent sequences: A276373 A276374 A276375 * A276377 A276378 A276379

Keyword

nonn,easy

Author

Juri-Stepan Gerasimov, Sep 01 2016

Status

approved