/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil meta import FormalConjecturesForMathlib.Combinatorics.Enumerative.Partition.Basic

No powers as partition numbers

There are no partition numbers $a(k)$ of the form $x^m$, with $x,m$ integers $>1$.

Reference: A41

@[expose] public sectionnamespace OeisA41open Nat@[category test, AMS 11] theorem partitionNumber_3 : partitionNumber 3 = 3 := ⊢ partitionNumber 3 = 3 All goals completed! 🐙@[category test, AMS 11] theorem partitionNumber_4 : partitionNumber 4 = 5 := ⊢ partitionNumber 4 = 5 All goals completed! 🐙@[category test, AMS 11] theorem partitionNumber_5 : partitionNumber 5 = 7 := ⊢ partitionNumber 5 = 7 All goals completed! 🐙

There are no partition numbers $a(k)$ of the form $x^m$, with $x,m$ integers $>1$. See comment by Zhi-Wei Sun (Dec 02 2013).

@[category research open, question, AMS 11] theorem noPowerPartitionNumber : ∀ k, ¬IsPerfectPower (partitionNumber k) := ⊢ ∀ (k : ℕ), ¬k.partitionNumber.IsPerfectPower All goals completed! 🐙end OeisA41