A380382 Largest number of districts possible for A380377(n).

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, 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, 17, 17, 17, 17, 17, 11, 11, 19, 19, 19, 19, 19, 9, 13, 13, 13, 13, 21

Offset

1,2

Comments

Largest 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)=551.

Crossrefs

Cf. A380377, A380378, A380381 (smallest number of districts).

Sequence in context: A066658 A005145 A280740 * A156350 A076367 A362840

Adjacent sequences: A380379 A380380 A380381 * A380383 A380384 A380385

Keyword

nonn

Author

Pontus von Brömssen, Jan 24 2025

Status

approved