Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.
A076262
Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on three generators that require exactly k multiplications for their formation.
Terms
- a(0) =9a(1) =0a(2) =27a(3) =0a(4) =9a(5) =72a(6) =0a(7) =0a(8) =69a(9) =174a(10) =0a(11) =0a(12) =33a(13) =324a(14) =372a(15) =0a(16) =0a(17) =0a(18) =273a(19) =1218a(20) =696a(21) =0a(22) =0a(23) =9a(24) =180a(25) =1440a(26) =3804a(27) =1128a(28) =0a(29) =0
External references
- oeis: A076262