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.

A321842 Number of words w of length n such that each letter of the senary 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)
6 720
7 2520
8 11760
9 43848
10 176490
11 665115
12 2630715
13 10224492
14 41126477
15 165441810
16 683213215
17 2840595291
18 12061223560
19 51668953199
20 225204435800
21 990537353423
22 4420156777761
23 19894290092220
24 90640449133488
25 416216322774452
26 1931286827029792
27 9024993532633957

List of values

[720, 2520, 11760, 43848, 176490, 665115, 2630715, 10224492, 41126477, 165441810, 683213215, 2840595291, 12061223560, 51668953199, 225204435800, 990537353423, 4420156777761, 19894290092220, 90640449133488, 416216322774452, 1931286827029792, 9024993532633957]