Table read by descending antidiagonals: T(k,n) (k >= 0, n>= 1) is number of ways to (k+2)-color a 3 X n grid ignoring the variations of two colors.
A355881
Table read by descending antidiagonals: T(k,n) (k >= 0, n>= 1) is number of ways to (k+2)-color a 3 X n grid ignoring the variations of two colors.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =9a(5) =3a(6) =1a(7) =41a(8) =49a(9) =4a(10) =1a(11) =187a(12) =801a(13) =169a(14) =5a(15) =1a(16) =853a(17) =13095a(18) =7141a(19) =441a(20) =6a(21) =1a(22) =3891a(23) =214083a(24) =301741a(25) =38897a(26) =961a(27) =7a(28) =1a(29) =17749
External references
- oeis: A355881