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.

A213863 Number of words w where each letter of the n-ary alphabet occurs 3 times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

Table of values

n a(n)
0 1
1 1
2 7
3 106
4 2575
5 87595
6 3864040
7 210455470
8 13681123135
9 1035588754375
10 89575852312675
11 8724157965777400
12 945424197750836500
13 112891958206958894500
14 14733016566584898017500
15 2086947723639167040631750
16 318968341048949169038143375

List of values

[1, 1, 7, 106, 2575, 87595, 3864040, 210455470, 13681123135, 1035588754375, 89575852312675, 8724157965777400, 945424197750836500, 112891958206958894500, 14733016566584898017500, 2086947723639167040631750, 318968341048949169038143375]