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 A204917 #5 Mar 30 2012 18:58:08 %S A204917 1,2,1,2,1,3,1,2,1,2,1,3,1,2,1,2,1,4,1,2,1,3,7,3,1,4,1,2,1,4,1,3,1,5, %T A204917 2,4,11,4,1,2,1,5,1,3,1,7,13,3,1,8,1,4,15,9,1,2,1,7,1,4 %N A204917 Least j such that n divides s(k)-s(j) for some k>j, where s(j)=(prime(j))^2. %C A204917 For a guide to related sequences, see A204892. %t A204917 (See the program at A204916.) %Y A204917 Cf. A204916, A204908, A204900, A204892. %K A204917 nonn %O A204917 1,2 %A A204917 _Clark Kimberling_, Jan 20 2012