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 A073367 #10 Nov 05 2020 19:26:34
%S A073367 0,0,0,0,0,0,3,0,3,4,3,1,8,0,8,0,10,9,8,9,8,8,7,6,6,8,7,8,8,7,6,5,4,6,
%T A073367 5,4,3,4,4,6,5,4,3,4,4,3,2,2,2,3,2,1,0,0,40,0,0,1,0,43,43,44,44,45,45,
%U A073367 45,45,46,47,48,48,49,50,50,50,52,53,53,53,55,55,55,55,55,55,56,56,56
%N A073367 Remainder when n-th composite is divided by number of composites not exceeding n.
%H A073367 Michael De Vlieger, <a href="/A073367/b073367.txt">Table of n, a(n) for n = 4..10000</a>
%F A073367 a(n) = A002808(n) mod A065855(n).
%e A073367 For n=4: a(4) = composite(4) mod (4-Pi(4)-1) = 9 mod 1 = 0; n=19:
%e A073367 a(19) = composite(19) mod (19-Pi(19)-1) = 30 mod 10 = 0.
%t A073367 f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] Table[Mod[f[w], w-PrimePi[w]-1], {w, 1, 128}]
%Y A073367 Cf. A002808, A065855.
%K A073367 nonn
%O A073367 4,7
%A A073367 _Labos Elemer_, Jul 30 2002
%E A073367 Edited by _Michael De Vlieger_, Nov 05 2020