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 A073366 #9 Nov 05 2020 19:26:12
%S A073366 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,
%T A073366 11,7,13,13,11,11,17,13,23,19,17,13,25,31,29,25,23,23,25,29,29,29,29,
%U A073366 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
%N A073366 Remainder when n-th prime is divided by number of composites not exceeding n.
%H A073366 Michael De Vlieger, <a href="/A073366/b073366.txt">Table of n, a(n) for n = 4..10000</a>
%F A073366 a(n) = A000040(n) mod A065855(n).
%e A073366 For n=4, p(4) mod 4-Pi(4)-1 = 7 mod 1 = 0 = a(4).
%t A073366 Table[Mod[Prime[w], w-PrimePi[w]-1], {w, 1, 128}]
%Y A073366 Cf. A000040, A065855.
%K A073366 nonn
%O A073366 4,6
%A A073366 _Labos Elemer_, Jul 30 2002
%E A073366 Edited by _Michael De Vlieger_, Nov 05 2020