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!)
A233688 Number of (n+1)X(5+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 1

%I #4 Dec 14 2013 19:07:51

%S 3940,64756,1095164,19588516,350631128,6324816860,113995582540,

%T 2057970474012,37133987692488,670381088418328,12099509545057848,

%U 218421025411832340,3942529399269404948,71168489691941827604

%N Number of (n+1)X(5+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 Column 5 of A233691

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

%H R. H. Hardin, <a href="/A233688/a233688.txt">Empirical recurrence of order 85</a>

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

%e Some solutions for n=2

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

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

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

%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 April 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)