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.

A110106 a(n) is the number of coverings of 1..n by cyclic words of length 3n, such that each value from 1 to n appears precisely twice. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,2,2,...,n,n}. Repeats of words are allowed in a given covering.

Table of values

n a(n)
0 1
1 6
2 3960
3 24151680
4 577882166400
5 38039350155206400
6 5605398331566095462400
7 1614162682147590619140096000
8 824800497779996439355497811968000

List of values

[1, 6, 3960, 24151680, 577882166400, 38039350155206400, 5605398331566095462400, 1614162682147590619140096000, 824800497779996439355497811968000]

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

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