login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A251205 Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to a nonzero multiple of 2 1

%I

%S 816,8870,102811,1273440,16687766,228610911,3233921644,46763019686,

%T 686058347195,10159339091240,151334638719070,2262714878984127,

%U 33910779419590532,508959584753961006,7645903821140304043

%N Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to a nonzero multiple of 2

%C Column 3 of A251210

%H R. H. Hardin, <a href="/A251205/b251205.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 49*a(n-1) -892*a(n-2) +6678*a(n-3) -4674*a(n-4) -183750*a(n-5) +483153*a(n-6) +2260797*a(n-7) -4216766*a(n-8) -19139302*a(n-9) -11705564*a(n-10) +15064560*a(n-11) +15309504*a(n-12) -790272*a(n-13) -2709504*a(n-14)

%e Some solutions for n=3

%e ..0..0..0..0....0..2..0..0....0..2..2..1....1..1..0..1....2..0..0..0

%e ..2..0..2..0....2..0..2..2....2..2..0..1....2..0..1..2....0..2..2..0

%e ..0..0..0..2....0..2..2..2....1..1..1..0....0..0..1..2....0..2..0..0

%e ..2..2..0..0....0..2..2..2....0..0..2..1....2..2..1..0....2..0..2..2

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 30 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 22:04 EDT 2019. Contains 324337 sequences. (Running on oeis4.)