login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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"). 2

%I

%S 1,3,3,3,9,15,33,63,153,219,261,351,585,879,933,1233,1401,1899,2301,

%T 3111

%N 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").

%C 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.

%Y Cf. A005598, A180238, A180239, A180437, A180438.

%K nonn

%O 0,2

%A _Fred Lunnon_, Sep 05 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 18:13 EDT 2020. Contains 337386 sequences. (Running on oeis4.)