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.

A073366 Remainder when n-th prime is divided by number of composites not exceeding n.

Original entry on oeis.org

0, 0, 1, 1, 1, 3, 4, 1, 1, 5, 1, 7, 8, 5, 1, 7, 5, 1, 1, 5, 5, 7, 5, 1, 17, 1, 18, 13, 11, 11, 7, 11, 7, 13, 13, 11, 11, 17, 13, 23, 19, 17, 13, 25, 31, 29, 25, 23, 23, 25, 29, 29, 29, 29, 25, 31, 29, 31, 35, 43, 41, 37, 35, 2, 1, 4, 49, 3, 2, 10, 9, 8, 5, 4, 5, 9, 10, 13, 8, 18, 13, 12
Offset: 4

Views

Author

Labos Elemer, Jul 30 2002

Keywords

Examples

			For n=4, p(4) mod 4-Pi(4)-1 = 7 mod 1 = 0 = a(4).
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[Prime[w], w-PrimePi[w]-1], {w, 1, 128}]

Formula

a(n) = A000040(n) mod A065855(n).

Extensions

Edited by Michael De Vlieger, Nov 05 2020