84500000domain: NAppears in sequencesLet df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(4,n).at n=26A132458Numbers that are the sum of 2 nonzero squares in exactly 11 ways.at n=9A236711