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!)
A233683 Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal 0

%I #4 Dec 14 2013 19:01:27

%S 32,548,19248,1723204,350631128,180309108120,213645503481064,

%T 637071561523768628,4389462721204153964920,76077651482837452211667424,

%U 3050446568436589473373323664384,307742402424024480499984248922221296

%N Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal

%C Diagonal of A233691

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 14 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 November 30 04:53 EST 2023. Contains 367453 sequences. (Running on oeis4.)