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 A068568 #2 Mar 31 2012 13:50:43
%S A068568 1,3,4,5,5,5,6,7,7,7,8,9,8,8,7,9,9,10,9,9,8,7,10,9,8,10,9,8,12,13,12,
%T A068568 13,12,11,14,13,13,13,12,11,10,13,12,11,10,9,8,7,6,14,13,14,13,13,12,
%U A068568 11,16,18,17,16,15,16,15,14,14,13,14,17,16,15,14,17,16,17,16,15,15,14
%N A068568 Let S = a subset of {n,n+1,n+2,..,n+m}, number of parts of S is more than 1. a(n) = smallest number m such that the product of parts of S is a square.
%D A068568 R. K. Guy, Unsolved Problems in Number Theory, B30.
%K A068568 easy,nonn
%O A068568 0,2
%A A068568 _Naohiro Nomoto_, Mar 26 2002