{"schema":"vela.problem-packet.v0.1","problem":725,"statement":"Give an asymptotic formula for the number of $k\\times n$ Latin rectangles.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A001009","name":"Triangle giving number L(n,k) of normalized k X n Latin rectangles.","terms":"1,1,1,1,1,1,1,3,4,4,1,11,46,56,56,1,53,1064,6552,9408,9408,1,309,35792,1293216,11270400,16942080,16942080,1,2119,1673792","url":"https://oeis.org/A001009"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}