This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A380381 #6 Jan 26 2025 21:02:24 %S A380381 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 A380381 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 A380381 7,7,9,9,13,13,13,13,21,21,5,5,5,7,7,7,11 %N A380381 Smallest number of districts needed for A380377(n). %C A380381 Smallest k such that A380378(n,k) = A380377(n). %H A380381 Pontus von Brömssen, <a href="/A380381/b380381.txt">Table of n, a(n) for n = 1..10000</a> %H A380381 Pontus von Brömssen, <a href="/A380378/a380378.png">Illustration for a(100000)=363</a>. %Y A380381 Cf. A380377, A380378, A380382 (largest number of districts). %K A380381 nonn %O A380381 1,4 %A A380381 _Pontus von Brömssen_, Jan 24 2025