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 A123314 #3 Mar 30 2012 18:50:55
%S A123314 4,0,2,3,0,5,0,2,2,0,3,3,3,2,0,6,0,3,0,2,3,0,3,2,0,2,3,0,5,0,4,3,3,3,
%T A123314 2,0,2,4,0,3,0,2,3,0,3,3,0,3,0,5,0,2,2,0,2,3,3,2,0,3,5,3,0,2,3,0,3,3,
%U A123314 0,2,3,0,5,0,3,0,5,3,2,0,3,5,0,2,0,2,3,0,2,4,0,3,5,0,3,2,0,3,2,3,2,0,6,0,4
%N A123314 Number of times the n-th squarefree number occurs as maximal greatest common divisor of pairs of distinct squarefree numbers.
%C A123314 a(n) > 0 iff A005117(n) is an odd squarefree number: a(A100112(A056911(n)))>0;
%C A123314 a(n) = 0 iff A005117(n) is an even squarefree number: a(A100112(A039956(n)))=0.
%F A123314 a(n) = #{k: A123313(k) = A005117(n)}.
%K A123314 nonn
%O A123314 1,1
%A A123314 _Reinhard Zumkeller_, Sep 25 2006