cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

Juri-Stepan Gerasimov, Sep 01 2016

Keywords

Crossrefs

Programs

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

Formula

a(n) = A007949(A061214(n)).
a(n) = Sum_{k = A000040(n)..A000040(n + 1)} A007949(k) for n > 2.
Showing 1-1 of 1 results.