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-2 of 2 results.

A180438 a(n) counts the distinct cubical (on alphabet of 3 symbols) billiard words with length n, acting as prefix to just k = 2 such words of length n+1 (that is, a subset of "special").

Original entry on oeis.org

0, 0, 6, 18, 36, 78, 150, 306, 420, 792, 1338, 2082, 3228, 4830, 7050, 9954, 13920, 18738, 24666, 32610
Offset: 0

Views

Author

Fred Lunnon, Sep 05 2010

Keywords

Comments

By symmetry under reversal, a(n) also counts length n cubical billiard words acting as suffix to just k length n+1 cubical billiard words. Computation: Fred Lunnon for 0 <= n <= 19 (Magma). The program in A180437 counts k-special words for k = 1, ..., m, where m = 3 denotes the size of the alphabet.

Crossrefs

Cf. A005598, A180238, A180239, A180437, A180439.

A180439 a(n) counts the distinct cubical (on alphabet of 3 symbols) billiard words with length n, acting as prefix to just k = 3 such words of length n+1 (that is, a subset of "special").

Original entry on oeis.org

1, 3, 3, 3, 9, 15, 33, 63, 153, 219, 261, 351, 585, 879, 933, 1233, 1401, 1899, 2301, 3111
Offset: 0

Views

Author

Fred Lunnon, Sep 05 2010

Keywords

Comments

By symmetry under reversal, a(n) also counts length n cubical billiard words acting as suffix to just k length n+1 cubical billiard words. Computation: Fred Lunnon for 0 <= n <= 19 (Magma). The program in A180437 counts k-special words for k = 1,...,m, where m = 3 denotes the size of the alphabet.

Crossrefs

Cf. A005598, A180238, A180239, A180437, A180438.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.