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 A273545 #20 May 27 2016 03:03:55
%S A273545 2,25,975,1105,1625,16575,739375,27625,71825,27625,58093750,480675,
%T A273545 93925,8547175,1077375,801125,76765625,2082925,783935546875,801125,
%U A273545 942703125,23740234375,1404178750,17784975,12138425,8300781250,106229175,700984375,221252441406250
%N A273545 Least number k such that k*n is the sum of two nonzero squares in exactly n ways.
%e A273545 a(2) = 25 because 25*2 = 50 is the least even number that is the sum of two nonzero squares in exactly 2 ways; 50 = 1^2 + 7^2 = 5^2 + 5^2.
%t A273545 nR[n_] := (SquaresR[2, n] + Plus @@ Pick[{-4, 4}, IntegerQ /@ Sqrt[{n, n/2}]])/8; a[n_] := Block[{k=1}, While[nR[n * k] != n, k++]; k]; Array[a, 10] (* _Giovanni Resta_, May 27 2016 *)
%Y A273545 Cf. A006339, A016032, A025426, A273238.
%K A273545 nonn
%O A273545 1,1
%A A273545 _Altug Alkan_, May 26 2016
%E A273545 a(6)-a(29) from _Giovanni Resta_, May 26 2016