Skip to content

A133989

OEIS Lean4

Define fu(1,1) = 0. Then a(n) = fu(1,n) = smallest number t such that an n X 1 strip of n squares can be cut into n squares using p_1, p_2, …, p_t cuts where p_t is a prime number or p_t = 1.

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.

low confidence
n12345678910111213
A1339890111212122232