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 A205012 #5 Mar 30 2012 18:58:10 %S A205012 2,6,20,6,6,20,20,70,20,70,3432,924,252,20,3432,70,70,20,20,3432,924, %T A205012 3432,70,924,70,252,924,924,252,3432,705432,70,3432,70,3432,48620, %U A205012 48620,3432,12870,12870,252,924,155117520,3432,48620,184756,3432 %N A205012 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=C(2j-2,j-1). %C A205012 For a guide to related sequences, see A204892. %t A205012 (See the program at A205010.) %Y A205012 Cf. A205010, A204892. %K A205012 nonn %O A205012 1,1 %A A205012 _Clark Kimberling_, Jan 22 2012