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 A239624 #8 Mar 14 2015 00:42:11
%S A239624 4,23,38,50,51,54,65,70,107,127,127,165,155,150,239,287,280,179,336,
%T A239624 314,230,453,423,600,612,419,246,454,455,892,1117,624,916,432,1115,
%U A239624 363,934,1061,763,1073,1203,524,1523,559,1278,735,2221,1987,929,475,1179,1605
%N A239624 Conjecturally, the number of numbers k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).
%C A239624 The 0th term is the largest number k such that binomial(2k,k) is squarefree.
%t A239624 b = 1; t = Table[b = b*(4 - 2/n); last = 0; Do[If[Mod[b, p^2] == 0, last = p], {p, Prime[Range[PrimePi[Sqrt[2*n]]]]}]; last, {n, 20000}]; t = Join[{0}, t]; Table[Length[Position[t, p]], {p, Join[{0}, Prime[Range[20]]]}]
%Y A239624 Cf. A110493, A110494, A239622, A239623.
%K A239624 nonn
%O A239624 0,1
%A A239624 _T. D. Noe_, Mar 27 2014