cp's OEIS Frontend

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.

Showing 1-4 of 4 results.

A151987 Number of legal starting configurations in the glass worms (or vers de verres) game with n glasses.

Original entry on oeis.org

1, 1, 3, 13, 64, 404, 2135, 21077, 111459, 1261637, 10767866, 111804384, 659105457, 18705101130
Offset: 0

Views

Author

Jacques Tramu, Mar 09 2009

Keywords

Comments

Suggested by a question from Eric Angelini.
See the Sequence Fans Mailing List link and also the Angelini link for further information.
It is conjectured that a(n)~(n+1)^(n+1)/exp(n). [From Dennis Hou, May 05 2010]

Crossrefs

Cf. A151986.

Extensions

Offset corrected by Joseph Myers, Sep 07 2009
a(9) to a(13) from Joseph Myers, Sep 08 2009

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

Views

Author

Dennis Hou, Apr 15 2010

Keywords

Crossrefs

Cf. A176450. - Dennis Hou, Apr 19 2010

Extensions

Definition edited for clarity by Kellen Myers, May 02 2010
a(9)-a(24) from Joseph Myers, Nov 13 2010

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

Views

Author

Dennis Hou, Apr 18 2010

Keywords

Crossrefs

Extensions

a(9)-a(24) from Joseph Myers, Nov 13 2010

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

Views

Author

Kellen Myers, May 02 2010

Keywords

Comments

The game is described in the websites listed, and already has other sequences, e.g., A151986. Note that this also gives the number of connected components, if we draw a graph of this process. The sequence gives the number of cycles, for a given number of cups. The sequence is increasing (append a 0 to all configurations in a cycle, and you get the same cycle with one more cup). It is strictly increasing since {n-1,0,0,0...,0} occurs in a cycle at stage n, but never before.
I am not clear on how this is meant to differ from A176450; my calculations reproduce the terms there not the ones in this sequence. - Joseph Myers, Nov 13 2010

Examples

			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.
		

Crossrefs

Related to A151986, A151987, A176336.

Extensions

Fixed error in sequence. Added small amount of formatting changes and elaboration. - Kellen Myers, May 03 2010
Showing 1-4 of 4 results.