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.

A213298 Number of n-length words w over 10-ary alphabet such that 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 10
2 100
3 865
4 6805
5 47590
6 297595
7 1662160
8 8418649
9 39598078
10 178880725
11 795246055
12 3519278713
13 15573399301
14 69314501935
15 311040898945
16 1411268823196
17 6478030875460
18 30129403442530
19 141971859499360
20 678365095896001
21 3285531463054108
22 16137537771997720

List of values

[1, 10, 100, 865, 6805, 47590, 297595, 1662160, 8418649, 39598078, 178880725, 795246055, 3519278713, 15573399301, 69314501935, 311040898945, 1411268823196, 6478030875460, 30129403442530, 141971859499360, 678365095896001, 3285531463054108, 16137537771997720]