A160540
The number of distinct n X n panmagic = pandiagonal = diabolic = Nasik squares, not counting rotations, reflections, or row/column cyclings of others, with the additional property that each i X j rectangle, including each “wrap-around” i X j rectangle, where i and j are positive integers whose product is n, also sums to the magic constant A006003(n) = n(n^2+1)/2.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A160540computable