cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A220704 Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.

This page as a plain text file.
%I A220704 #8 Jul 23 2025 01:22:16
%S A220704 1,1,3,13,107,1617,44976,2282408,216083336,37166744488,11934907610044,
%T A220704 6974153590170208,7595477025017870022,15083748097547577433271,
%U A220704 55729708477784939752304144,376141278066033748724918163244
%N A220704 Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.
%C A220704 Diagonal of A220708
%H A220704 R. H. Hardin, <a href="/A220704/b220704.txt">Table of n, a(n) for n = 1..18</a>
%e A220704 All solutions for n=3 0=self 3=ne 4=w 6=e 7=sw (reciprocal directions total 10)
%e A220704 .00.00.00...00.67.47...00.00.00
%e A220704 .00.00.00...36.34.00...00.67.47
%e A220704 .00.00.00...00.00.00...36.34.00
%K A220704 nonn
%O A220704 1,3
%A A220704 _R. H. Hardin_ Dec 18 2012