Skip to content

A236453

OEIS Lean4

Number of length n strings on the alphabet {0,1,2} of the form 0^i 1^j 2^k such that i,j,k>=0 and if i=1 then j=k.

offset: 0
codomain: ℕ