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.

A293891 Number of sets of nonempty words with a total of n letters over denary alphabet containing the tenth letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Table of values

n a(n)
10 1
11 11
12 121
13 992
14 7948
15 57368
16 407495
17 2762306
18 18558261
19 121903562
20 797628339
21 5164110575
22 33416303576
23 215354872472
24 1390196456927
25 8971242266557
26 58072455010621
27 376619368091666
28 2452238779936085
29 16018094650161058
30 105103750467074777
31 692390137170794830

List of values

[1, 11, 121, 992, 7948, 57368, 407495, 2762306, 18558261, 121903562, 797628339, 5164110575, 33416303576, 215354872472, 1390196456927, 8971242266557, 58072455010621, 376619368091666, 2452238779936085, 16018094650161058, 105103750467074777, 692390137170794830]

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

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