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!)
A351643 Number of length n word structures with all distinct runs using exactly 3 symbols. 3

%I #10 Jan 28 2023 22:07:47

%S 0,0,1,3,12,28,81,177,410,906,1869,4001,8094,16032,32355,62499,120078,

%T 227880,436743,805797,1487920,2751618,5017143,9063625,16153560,

%U 29066676,51334289,90784671,157941132,275244344,478874505,823848357,1412686722,2400778830,4091929101

%N Number of length n word structures with all distinct runs using exactly 3 symbols.

%C Permuting the symbols will not change the structure.

%H Andrew Howroyd, <a href="/A351643/b351643.txt">Table of n, a(n) for n = 1..1000</a>

%e The a(3) = 1 word is 123.

%e The a(4) = 3 words are 1123, 1223, 1233.

%e The a(5) = 12 words are 11123, 11213, 11223, 11231, 11233, 12113, 12223, 12232, 12233, 12311, 12322, 12333.

%o (PARI) \\ See A351641 for R, S.

%o seq(n)={my(q=S(n), c=3); sum(k=1, c, R(q^k-1)*binomial(c, k)*(-1)^(3-k))/c!}

%Y Column k=3 of A351641.

%Y Cf. A351644.

%K nonn

%O 1,4

%A _Andrew Howroyd_, Feb 16 2022

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 February 24 07:07 EST 2024. Contains 370294 sequences. (Running on oeis4.)