A380381 Smallest number of districts needed for A380377(n).

1, 1, 1, 3, 1, 4, 5, 3, 3, 3, 3, 8, 9, 3, 3, 3, 5, 5, 13, 3, 3, 3, 7, 7, 5, 5, 5, 3, 9, 9, 9, 9, 3, 3, 5, 5, 5, 7, 7, 3, 12, 12, 13, 13, 13, 5, 5, 9, 9, 7, 7, 7, 7, 5, 5, 5, 5, 11, 11, 11, 11, 7, 7, 7, 7, 7, 9, 9, 13, 13, 13, 13, 21, 21, 5, 5, 5, 7, 7, 7, 11

Offset: 1

Author

Pontus von Brömssen, Jan 24 2025

Keywords

• nonn

Comments

Smallest k such that A380378(n,k) = A380377(n).

Links

• Pontus von Brömssen, Table of n, a(n) for n = 1..10000
• Pontus von Brömssen, Illustration for a(100000)=363.

Crossrefs

Cf. A380377, A380378, A380382 (largest number of districts).