A235451
Number of length n words on alphabet {0,1,2} of the form 0^(i)1^(j)2^(k) such that i=j or j=k.
offset: 0
codomain: ℕ
Declarations
Section titled “Declarations”- A235451computable
Number of length n words on alphabet {0,1,2} of the form 0^(i)1^(j)2^(k) such that i=j or j=k.