{"paper":{"title":"On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Zaleski, Doron Zeilberger","submitted_at":"2017-12-28T22:31:43Z","abstract_excerpt":"Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the Fibonacci number F_{n+2}), the enumeration of (n+1,n+2)-core partitions into odd parts remains elusive.\n  Straub computed the first eleven terms of that sequence, and asked for a \"formula,\" or at least a fast way, to compute many terms. While we are unable to find a \"fast\" algorithm, we did manage to find a \"faster\" algorithm, which enabled us to compute 23 terms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10072","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}