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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293805 Number of multisets 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

%S 1,11,122,1003,8072,58393,415813,2822727,18990467,124845136,817467196,

%T 5294723066,34272624834,220905232624,1426144152942,9203001308101,

%U 59568878313749,386275420910370,2514732764176094,16423245577572038,107740652646320926,709605496053325546

%N Number of multisets 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="/A293805/b293805.txt">Table of n, a(n) for n = 10..1000</a>

%F a(n) = A293740(n) - A293739(n).

%Y Column k=10 of A293109.

%Y Cf. A293739, A293740.

%K nonn

%O 10,2

%A _Alois P. Heinz_, Oct 16 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.

Last modified August 11 20:13 EDT 2022. Contains 356067 sequences. (Running on oeis4.)