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!)
A233915 Number of (n+1)X(6+1) 0..7 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 16:13:40

%S 145004,4908404,148503096,5494251884,179779430264,6709328689904,

%T 224247343748408,8354188752786996,282149056961983552,

%U 10483870479310426784,356671417796342099644,13222669495882027796652

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

%H R. H. Hardin, <a href="/A233915/b233915.txt">Table of n, a(n) for n = 1..147</a>

%e Some solutions for n=1

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

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

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