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.

A292723 Number of multisets of nonempty words with a total of n letters over 8-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Table of values

n a(n)
0 1
1 1
2 4
3 14
4 67
5 343
6 2151
7 14900
8 119259
9 692640
10 4659774
11 30077836
12 209311030
13 1433872892
14 10689029713
15 76772260527
16 600293120366
17 4142024767610
18 30775147154084
19 221566161988587
20 1663421685691847
21 12221938274124959
22 93706886872251562
23 696726353909296853

List of values

[1, 1, 4, 14, 67, 343, 2151, 14900, 119259, 692640, 4659774, 30077836, 209311030, 1433872892, 10689029713, 76772260527, 600293120366, 4142024767610, 30775147154084, 221566161988587, 1663421685691847, 12221938274124959, 93706886872251562, 696726353909296853]

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

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