Least number k such that k*n is the sum of two nonzero squares in exactly n ways.

Terms

a(0) =2a(1) =25a(2) =975a(3) =1105a(4) =1625a(5) =16575a(6) =739375a(7) =27625a(8) =71825a(9) =27625a(10) =58093750a(11) =480675a(12) =93925a(13) =8547175a(14) =1077375a(15) =801125a(16) =76765625a(17) =2082925a(18) =783935546875a(19) =801125a(20) =942703125a(21) =23740234375a(22) =1404178750a(23) =17784975a(24) =12138425a(25) =8300781250a(26) =106229175a(27) =700984375