A380381 - OEIS

%I #6 Jan 26 2025 21:02:24

%S 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,

%T 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,

%U 7,7,9,9,13,13,13,13,21,21,5,5,5,7,7,7,11

%N Smallest number of districts needed for A380377(n).

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

%H Pontus von Brömssen, <a href="/A380381/b380381.txt">Table of n, a(n) for n = 1..10000</a>

%H Pontus von Brömssen, <a href="/A380378/a380378.png">Illustration for a(100000)=363</a>.

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

%K nonn

%O 1,4

%A _Pontus von Brömssen_, Jan 24 2025