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.

A320265 Number of proper multisets of nonempty words with a total of n letters over n-ary alphabet such that if a letter occurs in the multiset all predecessors occur at least once.

Table of values

n a(n)
2 1
3 3
4 23
5 178
6 1786
7 20927
8 282520
9 4299263
10 72750927
11 1353700567
12 27452623890
13 602326265519
14 14209892886819
15 358576428141962
16 9634718410829852
17 274567642777650028
18 8270000441627265937
19 262464788618069324640
20 8752908129221863491691
21 305968679117675345995513

List of values

[1, 3, 23, 178, 1786, 20927, 282520, 4299263, 72750927, 1353700567, 27452623890, 602326265519, 14209892886819, 358576428141962, 9634718410829852, 274567642777650028, 8270000441627265937, 262464788618069324640, 8752908129221863491691, 305968679117675345995513]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.