Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2*n+2, read by rows, where T(n,k) is the number of 2*(k+2*n-2)-cycles in the n X n grid graph which pass through four corners ((0,0), (0,n-1), (n-1,n-1), (n-1,0)).
A333668
Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2*n+2, read by rows, where T(n,k) is the number of 2*(k+2*n-2)-cycles in the n X n grid graph which pass through four corners ((0,0), (0,n-1), (n-1,n-1), (n-1,0)).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =6a(5) =1a(6) =12a(7) =58a(8) =156a(9) =146a(10) =1a(11) =24a(12) =244a(13) =1416a(14) =5435a(15) =12976a(16) =16654a(17) =7108a(18) =1072a(19) =1a(20) =40a(21) =696a(22) =7076a(23) =47965a(24) =236628a(25) =873610a(26) =2348664a(27) =4335724a(28) =4958224a(29) =3407276
External references
- oeis: A333668