cp's OEIS Frontend

A263119 Number of (n+3) X (1+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 A263119 #11 Apr 12 2019 06:57:05
%S A263119 14,29,59,119,238,477,955,1911,3822,7645,15291,30583,61166,122333,
%T A263119 244667,489335,978670,1957341,3914683,7829367,15658734,31317469,
%U A263119 62634939,125269879,250539758,501079517,1002159035,2004318071,4008636142
%N A263119 Number of (n+3) X (1+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.
%H A263119 R. H. Hardin, <a href="/A263119/b263119.txt">Table of n, a(n) for n = 1..210</a>
%F A263119 Empirical: a(n) = 2*a(n-1) + a(n-4) - 2*a(n-5) = A265381(n+2).
%F A263119 Empirical g.f.: x*(14 + x + x^2 + x^3 - 14*x^4) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 + x^2)). - _Colin Barker_, Jan 01 2019
%e A263119 Some solutions for n=4:
%e A263119 ..0..0..0..0....1..1..1..1....0..0..0..0....0..0..0..0....0..0..0..0
%e A263119 ..0..0..0..0....1..1..1..1....1..1..1..1....0..0..0..0....0..0..0..0
%e A263119 ..0..0..0..0....1..1..1..1....1..1..1..1....1..1..1..1....1..1..1..1
%e A263119 ..0..0..0..0....0..0..0..0....1..1..1..1....0..0..0..0....0..0..0..0
%e A263119 ..1..1..1..1....0..0..0..0....0..0..0..0....0..0..0..0....1..1..1..1
%e A263119 ..0..0..0..0....1..1..1..1....1..1..1..1....0..0..0..0....1..1..1..1
%e A263119 ..0..0..0..0....1..1..1..1....0..0..0..0....1..1..1..1....0..0..0..0
%Y A263119 Column 1 of A263124.
%K A263119 nonn
%O A263119 1,1
%A A263119 _R. H. Hardin_, Oct 10 2015