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 two generators that require exactly k multiplications for their formation.
A076261
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 two generators that require exactly k multiplications for their formation.
Terms
- a(0) =4a(1) =0a(2) =8a(3) =0a(4) =4a(5) =12a(6) =0a(7) =0a(8) =18a(9) =14a(10) =0a(11) =0a(12) =10a(13) =44a(14) =10a(15) =0a(16) =0a(17) =0a(18) =50a(19) =74a(20) =4a(21) =0a(22) =0a(23) =4a(24) =38a(25) =134a(26) =80a(27) =0a(28) =0a(29) =0
External references
- oeis: A076261