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 A073605 #3 Dec 05 2013 19:55:21
%S A073605 1,1,7,157,787,787,210997,5316097,34415167,703693777,194794490677,
%T A073605 5208806743927,138782093170507,5006786309605867,253579251611336437,
%U A073605 12551374903381164637,142908008812141343557,77053322014980646906357
%N A073605 Smallest number m such that m + k == 0 mod k-th prime for all k from 1 to n.
%e A073605 a(5) = 787 as 788, 789, 790, 791 and 792 are divisible by 2, 3, 5,7 and 11 respectively.
%t A073605 Needs["NumberTheory`NumberTheoryFunctions`"]; Table[ ChineseRemainder[ Table[i, {i, 0, -n + 1, -1}], Table[ Prime[i], {i, 1, n}]] - 1, {n, 2, 18} ]
%K A073605 nonn
%O A073605 1,3
%A A073605 _Amarnath Murthy_, Aug 04 2002
%E A073605 Edited, corrected and extended by _Robert G. Wilson v_, Aug 05 2002