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

%I #4 Dec 17 2013 07:33:33

%S 4292,47732,496200,5859504,64285728,759799284,8442821772,99513692668,

%T 1113177722808,13092724850804,147182159518872,1728448343828392,

%U 19509469596898344,228854323507171932,2592132414691402368

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

%C Column 4 of A233892

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

%e Some solutions for n=2

%e ..5..1..2..1..2....0..3..0..3..0....0..3..1..4..1....6..2..6..2..3

%e ..6..3..6..3..6....4..5..1..5..1....4..2..5..3..5....3..1..4..5..1

%e ..2..4..2..1..5....0..3..0..2..3....3..6..4..0..1....2..5..6..2..3

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 17 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 April 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)