{"id":"e-98d5ec9577026c22","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-1a86492085c1e21c","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":"c5c641473868a3550320bd2d17f4bbc4c49f6ffabfe9c5cad546919219ea396f","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":6466,"certificate_compressed_size":1848,"conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).","claims":[],"premises":[],"cited_by":[]}