22587domain: NAppears in sequencesT(n,k) = 1/k! * Sum_{i=0..k} (-1)^(k-i) *C(k,i) * A258309(n,i); triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.at n=27A258310a(n) is the maximum integer for which some minimum-length sum equaling a(n) of perfect squares less than n^2 excludes (n-1)^2.at n=30A377084