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 A380382 #7 Jan 26 2025 21:02:33 %S A380382 1,2,3,3,5,5,5,7,7,7,9,9,9,11,11,11,5,13,13,15,15,15,7,7,17,5,5,19,9, %T A380382 9,9,9,23,23,11,11,11,11,11,27,13,13,13,13,13,13,9,9,9,15,15,15,15,17, %U A380382 17,17,17,17,17,11,11,19,19,19,19,19,9,13,13,13,13,21 %N A380382 Largest number of districts possible for A380377(n). %C A380382 Largest k such that A380378(n,k) = A380377(n). %H A380382 Pontus von Brömssen, <a href="/A380382/b380382.txt">Table of n, a(n) for n = 1..10000</a> %H A380382 Pontus von Brömssen, <a href="/A380378/a380378.png">Illustration for a(100000)=551</a>. %Y A380382 Cf. A380377, A380378, A380381 (smallest number of districts). %K A380382 nonn %O A380382 1,2 %A A380382 _Pontus von Brömssen_, Jan 24 2025