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!)
A220679 Number of ways to reciprocally link elements of an nX6 array either to themselves or to exactly two horizontal, vertical and antidiagonal neighbors, without consecutive collinear links 1

%I

%S 1,169,4604,220299,9973284,455249977,21051034046,969333059888,

%T 44710643494095,2061425679292684,95053260696179636,

%U 4382893797173364311,202094068495963167552,9318534371184411614287,429675728242919953910812

%N Number of ways to reciprocally link elements of an nX6 array either to themselves or to exactly two horizontal, vertical and antidiagonal neighbors, without consecutive collinear links

%C Column 6 of A220681

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

%e Some solutions for n=3 0=self 2=n 3=ne 4=w 6=e 7=sw 8=s (reciprocal directions total 10)

%e .00.78.00.00.67.48...00.68.47.78.68.47...00.00.68.47.67.48...00.78.78.00.00.00

%e .36.24.68.34.78.27...00.23.38.27.23.78...68.47.23.38.67.24...38.23.27.78.00.78

%e .00.00.26.34.23.00...00.00.23.00.36.24...23.00.00.23.00.00...26.34.36.24.36.24

%K nonn

%O 1,2

%A _R. H. Hardin_ Dec 17 2012

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 January 31 15:32 EST 2023. Contains 359976 sequences. (Running on oeis4.)