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 A204931 #6 Feb 27 2013 09:44:09 %S A204931 1,3,6,3,2,6,7,10,6,15,5,10,32,13,15,10,7,6,9,15,13,5,4,10,15,32,21, %T A204931 28,14,15,38,10,19,13,28,21,72,9,32,15,20,13,53,19,21,25,40,10,28,15, %U A204931 13,32,57,21,27,28,9,14,8,15 %N A204931 Least k such that n divides A204930(k), the k-th difference of two distinct factorials. %C A204931 For a guide to related sequences, see A204892. %t A204931 (See the program at A204932.) %Y A204931 Cf. A204932, A204892. %K A204931 nonn %O A204931 1,2 %A A204931 _Clark Kimberling_, Jan 21 2012