The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A233955 Number of (n+1)X(5+1) 0..5 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

%S 39084,1120996,32938264,998464148,30386593584,929465951096,

%T 28436177941324,870959320798912,26671998316679332,817067896999830408,

%U 25027202601611013436,766691366573113479048,23485701669419454915552

%N Number of (n+1)X(5+1) 0..5 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 A233958

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 18 2013

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

Last modified November 30 08:19 EST 2021. Contains 349419 sequences. (Running on oeis4.)