|
%I #5 Mar 31 2012 12:37:30
%S 1331,59563,2713195,128454587,6168792219,299013108267,14575079152523,
%T 713014417713003,34962135163411115,1716944820423706411,
%U 84400236210902350123,4151550346703285808683,204295483850467630497195
%N Number of (n+1)X5 0..3 arrays with every 2X2 subblock having one or two distinct values, and new values 0..3 introduced in row major order
%C Column 4 of A209848
%H R. H. Hardin, <a href="/A209844/b209844.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 101*a(n-1) -3119*a(n-2) +23301*a(n-3) +332146*a(n-4) -4841510*a(n-5) +189458*a(n-6) +228888364*a(n-7) -753564284*a(n-8) -2816048344*a(n-9) +16949078144*a(n-10) -1771169504*a(n-11) -117752841744*a(n-12) +156873217312*a(n-13) +244896903072*a(n-14) -582512363712*a(n-15) -47046663680*a(n-16) +765499169280*a(n-17) -294034673664*a(n-18) -383848898560*a(n-19) +236348588032*a(n-20) +55918985216*a(n-21) -46495170560*a(n-22) -1491075072*a(n-23) +1811939328*a(n-24)
%e Some solutions for n=4
%e ..0..0..0..0..1....0..1..2..1..3....0..1..1..1..1....0..0..0..1..1
%e ..1..1..1..0..0....0..1..1..1..3....0..0..0..0..1....0..2..0..1..0
%e ..2..1..1..0..3....1..0..0..1..3....2..0..0..1..0....2..2..0..0..1
%e ..1..1..1..0..3....0..1..0..1..3....0..2..0..0..0....0..2..0..0..0
%e ..2..1..1..0..0....0..0..1..1..1....2..0..0..1..1....2..0..0..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 14 2012
| 