82924domain: NAppears in sequencesa(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square.at n=27A078714Record high values in A245340.at n=12A370956a(n) = n! * Sum_{k=0..n} Stirling2(2*k,k) * Stirling2(2*n-2*k,n-k) / binomial(n,k).at n=4A384470