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.

A073438 Remainder of division G[n]/Pi[n], where G[n] is the number of composites not exceeding n.

Original entry on oeis.org

0, 0, 1, 1, 2, 2, 3, 0, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 8, 0, 8, 9, 8, 9, 10, 0, 1, 2, 0, 1, 2, 3, 1, 2, 0, 1, 2, 3, 1, 2, 3, 4, 5, 6, 4, 5, 6, 7, 8, 9, 7, 8, 6, 7, 8, 9, 10, 11, 9, 10, 11, 12, 10, 11, 9, 10, 11, 12, 13, 14, 12, 13, 14, 15, 13, 14, 15, 16, 17, 18, 16, 17, 18
Offset: 2

Views

Author

Labos Elemer, Jul 31 2002

Keywords

Examples

			n=100: G[100]=100-Pi[100]-1=100-25-1=74, Pi[100]=25, remainder=a(100)=Mod[74,25]=24.
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[w-PrimePi[w]-1, PrimePi[w]], {w, 1, 128}]
    With[{nn=100},Mod[#[[1]]-#[[2]]-1,#[[2]]]&/@Thread[{Range[2,nn],PrimePi[Range[2,nn]]}]] (* Harvey P. Dale, Feb 26 2025 *)

Formula

a(n)=Mod[A065855(n), A000720(n)]=Mod[n-Pi[n]-1, Pi[n]] for n>1.