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.

A226879 Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 0, where #(w,x) counts the letters x in word w.

Table of values

n a(n)
0 1
1 1
2 3
3 10
4 47
5 246
6 1602
7 11481
8 95503
9 871030
10 5250758
11 38454351
12 273492122
13 2051148347
14 15736849481
15 125536061475
16 1041102777023
17 8537848507142
18 74739775725270
19 569218702884915
20 4674633861692302
21 37899687815748825
22 312237339834676391
23 2586068757754063445

List of values

[1, 1, 3, 10, 47, 246, 1602, 11481, 95503, 871030, 5250758, 38454351, 273492122, 2051148347, 15736849481, 125536061475, 1041102777023, 8537848507142, 74739775725270, 569218702884915, 4674633861692302, 37899687815748825, 312237339834676391, 2586068757754063445]