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 A201971 #9 Jan 12 2013 21:28:52
%S A201971 5,6,7,8,9,10,5,6,6,7,7,8,5,9,6,6,7,7,5,8,8,6,6,9,5,7,7,8,6,6,5,9,7,7,
%T A201971 7,6,5,8,8,8,7,7,5,6,9,8,8,8,5,6,6,9,9,9,5,8,6,6,7,10,5,9,9,6,6,7,5,
%U A201971 10,10,10,6,6,5,7,7,8,11,6,5,10,7,7,7,8,5
%N A201971 a(n) is the largest m such that n is congruent to -2, -1, 0, 1 or 2 mod k for all k from 1 to m.
%t A201971 f[n_] := Block[{k = 4, r}, While[r = Mod[n, k]; r < 3 || k - r < 3, k++]; k - 1]; Array[f, 100, 3]
%Y A201971 Cf. A187824.
%K A201971 easy,nonn
%O A201971 3,1
%A A201971 _Robert G. Wilson v_, Jan 09 2013