88594domain: 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=24A078714G.f.: (Product_{j>=1} 1/(1-q^j)^2 + Product_{j>=1} 1/(1-q^(2*j)))/2.at n=26A281357