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.

A353946 a(n) = (pi(2n-1) - pi(n-1))^pi(n) for n > 1, a(1) = 0.

Original entry on oeis.org

0, 2, 4, 4, 8, 8, 81, 16, 81, 256, 1024, 1024, 4096, 729, 4096, 15625, 78125, 16384, 390625, 65536, 390625, 1679616, 10077696, 10077696, 10077696, 10077696, 40353607, 40353607, 282475249, 282475249, 8589934592, 1977326743, 1977326743, 8589934592, 8589934592, 31381059609, 1000000000000
Offset: 1

Views

Author

Wesley Ivan Hurt, May 12 2022

Keywords

Comments

Number of functions from P to Q, where P is the set of primes <= n and Q is the set of primes q such that n <= q <= 2n-1.

Crossrefs

Cf. A000720 (pi), A035250, A352749.

Programs

  • Mathematica
    Join[{0}, Table[(PrimePi[2 n - 1] - PrimePi[n - 1])^PrimePi[n], {n, 2, 30}]]

Formula

a(n) = A035250(n)^A000720(n) for n > 1, a(1) = 0.