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.

A226880 Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 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 8879558
11 58412751
12 473076122
13 3607903547
14 29782240841
15 241773783075
16 2137404383423
17 18482746670342
18 173563010955990
19 1554987178737075
20 15169020662626702
21 126731980207937625
22 1160565179374262951

List of values

[1, 1, 3, 10, 47, 246, 1602, 11481, 95503, 871030, 8879558, 58412751, 473076122, 3607903547, 29782240841, 241773783075, 2137404383423, 18482746670342, 173563010955990, 1554987178737075, 15169020662626702, 126731980207937625, 1160565179374262951]