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.

A166260 a(n) = A089026(n) - 1.

Original entry on oeis.org

0, 1, 2, 0, 4, 0, 6, 0, 0, 0, 10, 0, 12, 0, 0, 0, 16, 0, 18, 0, 0, 0, 22, 0, 0, 0, 0, 0, 28, 0, 30, 0, 0, 0, 0, 0, 36, 0, 0, 0, 40, 0, 42, 0, 0, 0, 46, 0, 0, 0, 0, 0, 52, 0, 0, 0, 0, 0, 58, 0, 60, 0, 0, 0, 0, 0, 66, 0, 0, 0, 70, 0, 72, 0, 0, 0, 0, 0, 78, 0, 0, 0, 82, 0, 0, 0, 0, 0, 88, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Mats Granvik, Oct 10 2009

Keywords

Comments

Same as A061006 except for a(4) = 0 (Wilson's Theorem). - Georg Fischer, Oct 12 2018

Crossrefs

Cf. A119690. - R. J. Mathar, Oct 16 2009

Programs

  • PARI
    a(n) = if (isprime(n), n-1, 0); \\ Michel Marcus, Oct 12 2018

Formula

a(n) = (n-1) * A010051(n). - Wesley Ivan Hurt, Oct 12 2018