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.
%I A067964 #27 May 20 2021 01:26:00 %S A067964 2,8,90,1876,103484,11462588,3118943536,1808994829500, %T A067964 2465526600093372,7394315828592829424,50975951518289853305508, %U A067964 784977037926751747674903856,27509351187362150581313065415008,2167705218542258344490649896364635660,387057670485382113845659790427906287869964 %N A067964 Number of binary arrangements without adjacent 1's on n X n array connected n-s nw-se. %H A067964 Vaclav Kotesovec, <a href="/A067964/b067964.txt">Table of n, a(n) for n = 1..21</a> %H A067964 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p. 69-71. %F A067964 Limit n->infinity (a(n))^(1/n^2) = 1.503048082... (see A085850) %e A067964 Neighbors for n=4 (dots represent spaces): %e A067964 . o..o..o..o %e A067964 . |\ |\ |\ | %e A067964 . | \| \| \| %e A067964 . o..o..o..o %e A067964 . |\ |\ |\ | %e A067964 . | \| \| \| %e A067964 . o..o..o..o %e A067964 . |\ |\ |\ | %e A067964 . | \| \| \| %e A067964 . o..o..o..o %Y A067964 Cf. circle A000204, line A000045, arrays: ne-sw nw-se A067965, e-w ne-sw nw-se A067963, e-w n-s nw-se A066864, e-w ne-sw n-s nw-se A063443, n-s A067966, e-w n-s A006506, nw-se A067962, toruses: bare A002416, ne-sw nw-se A067960, ne-sw n-s nw-se A067959, e-w ne-sw n-s nw-se A067958, n-s A067961, e-w n-s A027683, e-w ne-sw n-s A066866. %K A067964 nonn,nice,hard %O A067964 1,1 %A A067964 _R. H. Hardin_, Feb 02 2002 %E A067964 Terms a(14)-a(18) from _Vaclav Kotesovec_, May 01 2012