login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A192296 Number of ternary words of length 2n obtained by self-shuffling. 2
1, 3, 15, 93, 621, 4425, 32703, 248901, 1934007, 15285771, 122437215, 991731999, 8107830597 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

See A191755 for the number of binary words of length 2n obtained by self-shuffling and also for an explanation of "self-shuffling" and a reference.

LINKS

Table of n, a(n) for n=0..12.

N. Rampersad and J. Shallit, Shuffling and unshuffling, preprint, arXiv:1106.5767 [cs.FL], 2011.

EXAMPLE

a(2) = 15 because {0,0,0,0}, {0,0,1,1}, {0,0,2,2}, {0,1,0,1}, {0,2,0,2}, {1,0,1,0}, {1,1,0,0}, {1,1,1,1}, {1,1,2,2}, {1,2,1,2}, {2,0,2,0}, {2,1,2,1}, {2,2,0,0}, {2,2,1,1}, {2,2,2,2} (and no other ternary words of length 4) are generated by self-shuffling.

CROSSREFS

Cf. A191755.

Sequence in context: A231657 A303558 A193661 * A002893 A256335 A258313

Adjacent sequences:  A192293 A192294 A192295 * A192297 A192298 A192299

KEYWORD

nonn,more

AUTHOR

John W. Layman, Jun 27 2011

EXTENSIONS

a(8)-a(9) from Alois P. Heinz, Sep 26 2011

a(10)-a(12) from Bert Dobbelaere, Oct 02 2018

STATUS

approved

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 December 14 05:36 EST 2019. Contains 329978 sequences. (Running on oeis4.)