{"id":"e-0dd9dd479c1351ab","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-ad76c988c6fc899c","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"c5742fb24de20cec163fc399d525b4b3bfef3eb2af1a3a640fb85f93d2f9d042","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":28183,"certificate_compressed_size":5072,"conclusion_name":"shift_x_plus_one of basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)).","claims":[],"premises":[],"cited_by":[]}