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!)
A233887 Number of (n+1)X(3+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 #5 Aug 11 2014 22:45:56

%S 1264,9376,65280,496200,3580624,27131156,197246776,1489635452,

%T 10865513648,81862032376,598379968648,4500240416436,32947358044272,

%U 247440445604280,1813879830869864,13606842940349600,99852380084946000

%N Number of (n+1)X(3+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 3 of A233892

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

%H R. H. Hardin, <a href="/A233887/a233887.txt">Empirical recurrence of order 58</a>

%F Empirical recurrence of order 58 (see link above)

%e Some solutions for n=3

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

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

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

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

%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 August 19 02:38 EDT 2024. Contains 375284 sequences. (Running on oeis4.)