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.

A213869 Number of words w where each letter of the n-ary alphabet occurs 9 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 6292
3 846167608
4 673174876488400
5 1785201362960729511070
6 11481253272835564584899247346
7 146812609193179942830629976945746464
8 3264601141014490309682718148875987514642243
9 114752550881830601773639529476205016572641397025904

List of values

[1, 1, 6292, 846167608, 673174876488400, 1785201362960729511070, 11481253272835564584899247346, 146812609193179942830629976945746464, 3264601141014490309682718148875987514642243, 114752550881830601773639529476205016572641397025904]