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 A205380 #5 Mar 30 2012 18:58:10 %S A205380 9,9,25,9,49,25,81,9,81,49,169,25,225,81,121,25,361,81,441,49,169,169, %T A205380 625,25,225,225,225,81,961,121,1089,81,289,361,289,81,1521,441,361,49, %U A205380 1849,169,2025,169,361,625,2401,49,441,225,529,225,3025,225 %N A205380 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=(2j-1)^2. %C A205380 For a guide to related sequences, see A204892. %t A205380 (See the program at A205378.) %Y A205380 Cf. A205378, A204892. %K A205380 nonn %O A205380 1,1 %A A205380 _Clark Kimberling_, Jan 26 2012