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.
%I A073368 #6 Oct 15 2013 22:31:27
%S A073368 0,0,0,1,2,1,0,1,0,1,0,7,7,8,8,9,9,9,9,10,10,10,10,10,10,11,11,12,12,
%T A073368 12,12,12,12,13,13,13,13,14,14,15,15,15,15,16,16,16,16,16,16,17,17,17,
%U A073368 17,17,17,18,18,19,19,19,19,19,19,20,20,20,20,21,21,22,22,22,22,22,22
%N A073368 Remainder when n is divided by number of composites not exceeding n.
%F A073368 a(n)=Mod[n, A065855(n)]
%e A073368 n=14: a(14)=Mod[14,14-Pi(14)-1]=Mod[14,14-7]=0; n=15: a(15)=Mod[15,15-Pi(15)-1]=Mod[15,7]=1.
%t A073368 Table[Mod[w, w-PrimePi[w]-1], {w, 1, 128}]
%Y A073368 Cf. A065855, A073366, A073367.
%K A073368 nonn
%O A073368 4,5
%A A073368 _Labos Elemer_, Jul 30 2002