cp's OEIS Frontend

A263124 T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.

%I A263124 #4 Oct 10 2015 07:09:28
%S A263124 14,36,29,168,148,59,912,1664,522,119,52446,28048,10356,1708,238,
%T A263124 502800,887805,316392,56288,5124,477,5950176,21881010,17782827,
%U A263124 3049840,238104,15640,955,79674864,583371100,881938092,344322375,16751376,1294448,47602
%N A263124 T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
%C A263124 Table starts
%C A263124 ...14.....36......168........912........52446........502800.......5950176
%C A263124 ...29....148.....1664......28048.......887805......21881010.....583371100
%C A263124 ...59....522....10356.....316392.....17782827.....881938092...47672389112
%C A263124 ..119...1708....56288....3049840....344322375...33563774112.3600054345088
%C A263124 ..238...5124...238104...16751376...6946980030.1213776549696
%C A263124 ..477..15640..1294448..216762400.113558538589
%C A263124 ..955..47602..6844676.2168966344
%C A263124 .1911.144236.35274768
%C A263124 .3822.432708
%C A263124 .7645
%H A263124 R. H. Hardin, <a href="/A263124/b263124.txt">Table of n, a(n) for n = 1..59</a>
%F A263124 Empirical for column k:
%F A263124 k=1: a(n) = 2*a(n-1) +a(n-4) -2*a(n-5)
%F A263124 k=2: [order 46]
%e A263124 Some solutions for n=3 k=4
%e A263124 ..0..0..0..0..0..0..0....1..0..0..1..0..1..1....1..1..0..1..0..0..1
%e A263124 ..0..0..0..0..0..0..0....0..0..1..1..1..1..0....1..1..0..1..0..0..1
%e A263124 ..0..0..0..0..0..0..0....0..0..0..0..0..0..0....0..1..0..1..1..0..1
%e A263124 ..0..0..1..1..1..1..0....0..1..1..1..1..0..0....0..0..0..0..0..0..0
%e A263124 ..0..0..0..0..0..0..0....1..0..0..1..0..1..1....0..0..1..1..1..1..0
%e A263124 ..1..1..0..1..0..0..1....1..0..1..1..0..1..0....1..0..0..1..0..1..1
%K A263124 nonn,tabl
%O A263124 1,1
%A A263124 _R. H. Hardin_, Oct 10 2015