# Greetings from The On-Line Encyclopedia of Integer Sequences! https://backiee.wasmer.app/https_oeis_org/

Search: id:a251500
Showing 1-1 of 1

%I A251500 #9 Nov 29 2018 15:41:06
%S A251500 226,3250,46684,670690,9635410,138426508,1988695378,28570462642,
%T A251500 410455690300,5896784936386,84715776652690,1217063686620268,
%U A251500 17484866170347826,251195190815325682,3608779345177708828
%N A251500 Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 3 4 5 6 7 8 or 9.
%H A251500 R. H. Hardin, <a href="/A251500/b251500.txt">Table of n, a(n) for n = 1..210</a>
%F A251500 Empirical: a(n) = 13*a(n-1) + 21*a(n-2) - 18*a(n-3) - 24*a(n-4).
%F A251500 Empirical g.f.: 2*x*(113 + 156*x - 156*x^2 - 192*x^3) / (1 - 13*x - 21*x^2 + 18*x^3 + 24*x^4). - _Colin Barker_, Nov 29 2018
%e A251500 Some solutions for n=3:
%e A251500 ..0..0....2..3....3..1....2..2....2..1....2..3....0..3....2..0....0..3....3..0
%e A251500 ..3..0....2..0....2..1....0..3....0..3....2..1....1..3....0..1....0..0....0..0
%e A251500 ..1..3....3..0....1..1....3..3....3..0....1..3....2..0....0..3....3..3....1..3
%e A251500 ..1..1....1..1....3..2....1..1....2..0....0..0....2..0....1..3....1..1....1..0
%Y A251500 Column 1 of A251507.
%K A251500 nonn
%O A251500 1,1
%A A251500 _R. H. Hardin_, Dec 03 2014

# Content is available under The OEIS End-User License Agreement: https://backiee.wasmer.app/https_oeis_org/LICENSE