login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233788 Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 1

%I #4 Dec 15 2013 20:47:24

%S 2856,19396,125976,966892,6892448,58623880,443965172,4064000052,

%T 31925115348,306087278904,2454080129016,24176541741092,

%U 195967141075428,1960732403749404,15985700459500860,161362564368374036

%N Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11

%C Column 4 of A233792

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

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 15 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 11 05:49 EDT 2024. Contains 375814 sequences. (Running on oeis4.)