A293964 - cp's OEIS frontend

A293964 Number of sets of exactly two nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

n	a(n)
3	2
4	5
5	18
6	52
7	168
8	533
9	1792
10	6161
11	22088
12	81690
13	313224
14	1239532
15	5068320
16	21355130
17	92714368
18	413915690
19	1899260064
20	8941932948
21	43168351136
22	213385326440
23	1079240048256
24	5578228370404
25	29443746273792
26	158547032884868
27	870370433845888
28	4866859874106392

[2, 5, 18, 52, 168, 533, 1792, 6161, 22088, 81690, 313224, 1239532, 5068320, 21355130, 92714368, 413915690, 1899260064, 8941932948, 43168351136, 213385326440, 1079240048256, 5578228370404, 29443746273792, 158547032884868, 870370433845888, 4866859874106392]

cp's OEIS Frontend

A293964 Number of sets of exactly two nonempty words with a total of n letters over n-ary alphabet 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

List of values