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.

A318796 Number of 2n-length words w over an n-ary alphabet {a1, a2, ..., an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,an) >= 1, where #(w,x) counts the letters x in word w.

Table of values

n a(n)
0 1
1 1
2 10
3 180
4 6496
5 322560
6 25098480
7 2437475040
8 322951749120
9 51882551360640
10 10494386800934400
11 2503138912988313600
12 720738068391525381120
13 239324670990042333696000
14 92995858936970165240064000
15 41062460981196018797072640000
16 20742554869763399771711348736000

List of values

[1, 1, 10, 180, 6496, 322560, 25098480, 2437475040, 322951749120, 51882551360640, 10494386800934400, 2503138912988313600, 720738068391525381120, 239324670990042333696000, 92995858936970165240064000, 41062460981196018797072640000, 20742554869763399771711348736000]