A151986
Maximal number of moves in the glass worms (or vers de verres) game with n glasses before detecting a cycle.
Original entry on oeis.org
1, 2, 4, 7, 10, 13, 20, 22, 42, 43, 64, 65, 146, 147, 203, 239, 412, 413, 414, 415
Offset: 1
Edited and terms a(12) to a(20) from Sep 2009 discussion added by
Joseph Myers, Nov 12 2010
A176336
Total number of configurations that appear in the cycles, in the glass worms (or vers de verres) game with n glasses.
Original entry on oeis.org
1, 2, 5, 12, 33, 64, 237, 364, 1309, 2912, 7989, 10036, 80757, 88948, 226889, 732996, 2313981, 2445052, 19491205, 20015492, 114457609, 188499788, 270028737, 278417344
Offset: 1
A176450
Number of distinct cycles in the glass worms (or vers de verres) game with n glasses that are not equivalent as sets.
Original entry on oeis.org
1, 2, 4, 7, 14, 21, 54, 73, 187, 345, 768, 955, 4989, 5620, 12347, 30326, 84807, 92518, 544421, 572016, 2390850, 3811427, 6182184, 6546907
Offset: 1
A177101
The number of cycles in the Vers de Verres game, where 'worms' are transferred between 'cups' in a deterministic fashion. Because this defines a finite-state automaton, we know that every state eventually enters a cycle (or fixed point, which is essentially a cycle of length 1). The number of 'cups' (frequently called 'n') is a parameter for this automaton, and so we count the cycles (and fixed points) with respect to n.
Original entry on oeis.org
1, 2, 4, 7, 13, 14, 20
Offset: 1
For n=4, there are seven cycles: {0300,3000,0030}, {3300,3003,0330}, {0200,2000}, {3330}, {2200}, {1000}, {0000}. Note that four of these are "inherited" from n=3, as described above.
Fixed error in sequence. Added small amount of formatting changes and elaboration. -
Kellen Myers, May 03 2010
Showing 1-4 of 4 results.
Comments