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!)
A220646 Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two king-move neighbors, without 3-loops 0

%I #5 Dec 18 2015 18:18:24

%S 1,4,333,192413,1233993907,85240331175084

%N Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two king-move neighbors, without 3-loops

%C Diagonal of A220652

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

%e .00.69.47...68.49.00...68.46.48...89.68.48...68.46.48...00.78.00...00.89.00

%e .89.37.18...26.48.18...26.47.27...29.12.27...29.89.28...38.26.48...68.24.17

%e .23.16.24...00.26.24...36.34.00...00.13.00...00.12.12...26.46.24...26.34.00

%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 July 15 14:40 EDT 2024. Contains 374332 sequences. (Running on oeis4.)