login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321032 Number of words of length 3n such that all letters of the binary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word. 2

%I

%S 3,18,97,530,2973,17059,99657,590562,3540463,21430266,130771375,

%T 803538099,4967127735,30866224823,192696614729,1207967820098,

%U 7600482116931,47981452358200,303820299643137,1929099000980218,12279621792772821,78346444891033855

%N Number of words of length 3n such that all letters of the binary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word.

%H Alois P. Heinz, <a href="/A321032/b321032.txt">Table of n, a(n) for n = 2..1211</a>

%e a(2) = 3: aaabbb, aabbba, abbbaa.

%e a(3) = 18: aaaaaabbb, aaaaabbba, aaaabbbaa, aaabaaabb, aaabbaaab, aaabbbaaa, aaabbbbbb, aabaaabba, aabbaaaba, aabbbaaaa, aabbbabbb, aabbbbbba, abaaabbaa, abbaaabaa, abbbaaaaa, abbbaabbb, abbbabbba, abbbbbbaa.

%p b:= (n, k)-> `if`(n=0, 1, k/n*add(binomial(3*n, j)*(n-j)*(k-1)^j, j=0..n-1)):

%p a:= n-> (k-> add((-1)^i*b(n, k-i)/(i!*(k-i)!), i=0..k))(2):

%p seq(a(n), n=2..25);

%Y Column k=2 of A256311.

%K nonn

%O 2,1

%A _Alois P. Heinz_, Oct 26 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 10:46 EDT 2021. Contains 348150 sequences. (Running on oeis4.)