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.

A213868 Number of words w where each letter of the n-ary alphabet occurs 8 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 1859
3 48349015
4 5795673908453
5 1953740543358042205
6 1409438188685787895321841
7 1835364055105945091130559202709
8 3847028733161627562733350467148495403
9 11963401430840044468894095677711389363239184
10 51960277212541922189750307005207837858451630919380

List of values

[1, 1, 1859, 48349015, 5795673908453, 1953740543358042205, 1409438188685787895321841, 1835364055105945091130559202709, 3847028733161627562733350467148495403, 11963401430840044468894095677711389363239184, 51960277212541922189750307005207837858451630919380]