A360361 Maximum length of the transient part when repeatedly applying the move described in A360360 to a deck of n colored cards.

0, 0, 1, 4, 6, 11, 18, 24, 44, 58, 96, 120, 210, 254

Offset

1,4

Links

Table of n, a(n) for n=1..14.

Example

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.
Lexicographically first optimal initial configuration for 1 <= n <= 14:
   n  a(n)  configuration
   1    0   0
   2    0   00
   3    1   001
   4    4   0012
   5    6   01112
   6   11   011023
   7   18   0111023
   8   24   01221034
   9   44   012110234
  10   58   0111234234
  11   96   01200321345
  12  120   011102345345
  13  210   0122112345345
  14  254   01112345326546

Crossrefs

Cf. A360360, A360362.

Sequence in context: A296468 A060577 A360042 * A197985 A058579 A022318

Adjacent sequences: A360358 A360359 A360360 * A360362 A360363 A360364

Keyword

nonn,more

Author

Pontus von Brömssen, Feb 04 2023

Status

approved