|
%I #4 Oct 08 2015 07:56:56
%S 98,512,512,3711,6928,3711,24013,92472,92472,24013,142344,1198816,
%T 2840827,1198816,142344,839216,14394128,78521045,78521045,14394128,
%U 839216,5128489,174159952,1961083623,4513054617,1961083623,174159952
%N T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.
%C Table starts
%C .......98.........512...........3711.............24013...............142344
%C ......512........6928..........92472...........1198816.............14394128
%C .....3711.......92472........2840827..........78521045...........1961083623
%C ....24013.....1198816.......78521045........4513054617.........229943416429
%C ...142344....14394128.....1961083623......229943416429.......23445293636576
%C ...839216...174159952....49018256112....11717714846408.....2390537108662112
%C ..5128489..2100720600..1240713997903...606552926150035...248073875762917543
%C .31001921.25327918144.31213035514119.31163234729146717.25521562144224919147
%H R. H. Hardin, <a href="/A263040/b263040.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 30]
%F k=2: [order 31]
%e Some solutions for n=2 k=4
%e ..0..0..0..1..0..0....0..1..0..0..0..0....0..0..0..1..0..0....0..0..1..1..1..0
%e ..0..1..0..0..1..1....0..0..1..0..0..1....1..1..0..0..1..1....0..0..0..0..0..1
%e ..0..1..0..1..1..1....0..1..1..1..0..1....0..1..0..0..1..1....0..0..1..0..0..1
%e ..1..1..1..1..1..1....1..1..1..1..1..0....0..0..1..1..1..0....1..1..1..0..0..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 08 2015
| 