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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266080 Number of nX7 integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one. 1

%I

%S 1,1,10,23,55,146,466,1155,3364,9229,25566,70308,196647,544696,

%T 1527557,4229863,11872589,32954820,92269343,256481433,718070373,

%U 1997666638,5589444252,15558565416,43515994717,121194482007,338915914513

%N Number of nX7 integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one.

%C Column 7 of A266081.

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

%e Some solutions for n=4

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

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

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

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

%Y Cf. A266081.

%K nonn

%O 1,3

%A _R. H. Hardin_, Dec 20 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 09:10 EDT 2021. Contains 347630 sequences. (Running on oeis4.)