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 A360361 #4 Feb 26 2023 20:09:07 %S A360361 0,0,1,4,6,11,18,24,44,58,96,120,210,254 %N A360361 Maximum length of the transient part when repeatedly applying the move described in A360360 to a deck of n colored cards. %e A360361 For n = 5, the initial configuration 01112 (with the top of the deck to the left) requires 6 moves to reach the first configuration in the eventual cycle: 01112 -> 10112 -> 01121 -> 10121 -> 01211 -> 10211 -> 02111 -> 20111 -> 02111. This is the maximum for 5 cards, so a(5) = 6. %e A360361 Lexicographically first optimal initial configuration for 1 <= n <= 14: %e A360361 n a(n) configuration %e A360361 1 0 0 %e A360361 2 0 00 %e A360361 3 1 001 %e A360361 4 4 0012 %e A360361 5 6 01112 %e A360361 6 11 011023 %e A360361 7 18 0111023 %e A360361 8 24 01221034 %e A360361 9 44 012110234 %e A360361 10 58 0111234234 %e A360361 11 96 01200321345 %e A360361 12 120 011102345345 %e A360361 13 210 0122112345345 %e A360361 14 254 01112345326546 %Y A360361 Cf. A360360, A360362. %K A360361 nonn,more %O A360361 1,4 %A A360361 _Pontus von Brömssen_, Feb 04 2023