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.

A321844 Number of words w of length n such that each letter of the octonary alphabet is used at least once 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)
8 40320
9 181440
10 1058400
11 4823280
12 23296680
13 103757940
14 478790130
15 2149170345
16 9894491985
17 45282147720
18 211500002835
19 991730832582
20 4733756233145
21 22787184211575
22 111475945291060
23 551049677448403
24 2764601557859302
25 14023910986706605
26 72114359742608090

List of values

[40320, 181440, 1058400, 4823280, 23296680, 103757940, 478790130, 2149170345, 9894491985, 45282147720, 211500002835, 991730832582, 4733756233145, 22787184211575, 111475945291060, 551049677448403, 2764601557859302, 14023910986706605, 72114359742608090]