login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #4 Oct 18 2017 19:01:52

%S 1,11,121,992,7948,57368,407495,2762306,18558261,121903562,797628339,

%T 5164110575,33416303576,215354872472,1390196456927,8971242266557,

%U 58072455010621,376619368091666,2452238779936085,16018094650161058,105103750467074777,692390137170794830

%N 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.

%H Alois P. Heinz, <a href="/A293891/b293891.txt">Table of n, a(n) for n = 10..1000</a>

%F a(n) = A293749(n) - A293748(n).

%Y Column k=10 of A293113.

%Y Cf. A293748, A293749.

%K nonn

%O 10,2

%A _Alois P. Heinz_, Oct 18 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)