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!)
A293739 Number of multisets of nonempty words with a total of n letters over nonary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. 5

%I #9 Dec 19 2020 03:23:01

%S 1,1,3,7,20,54,164,500,1630,5472,19256,70121,265723,1041184,4225484,

%T 17689505,76392933,339283021,1548592471,7246210567,34725853445,

%U 170096822940,850715642495,4337263437693,22519434992230,118916581795167,638088881489144,3475474084479428

%N Number of multisets of nonempty words with a total of n letters over nonary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

%C This sequence differs from A293110 first at n=10.

%H Alois P. Heinz, <a href="/A293739/b293739.txt">Table of n, a(n) for n = 0..1000</a>

%F G.f.: Product_{j>=1} 1/(1-x^j)^A212915(j).

%F a(n) ~ c * 9^n / n^18, where c = 978644175524508179.918397627321774... - _Vaclav Kotesovec_, Dec 19 2020

%Y Column k=9 of A293108.

%Y Cf. A212915, A293110, A293748.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 15 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 24 07:54 EDT 2024. Contains 371922 sequences. (Running on oeis4.)