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 A221886 #6 Jul 23 2025 02:18:07 %S A221886 1,3,3,6,33,6,13,326,326,13,28,3223,11878,3223,28,60,31832,449069, %T A221886 449069,31832,60,129,314426,16834526,65039658,16834526,314426,129,277, %U A221886 3105733,632170065,9356131846,9356131846,632170065,3105733,277,595,30676867 %N A221886 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction. %C A221886 Table starts %C A221886 ...1........3...........6............13............28............60 %C A221886 ...3.......33.........326..........3223.........31832........314426 %C A221886 ...6......326.......11878........449069......16834526.....632170065 %C A221886 ..13.....3223......449069......65039658....9356131846.1347142288446 %C A221886 ..28....31832....16834526....9356131846.5123355027782 %C A221886 ..60...314426...632170065.1347142288446 %C A221886 .129..3105733.23731120064 %C A221886 .277.30676867 %C A221886 .595 %H A221886 R. H. Hardin, <a href="/A221886/b221886.txt">Table of n, a(n) for n = 1..49</a> %e A221886 Some solutions for n=3 k=4 %e A221886 ..0..3..0..2....0..3..1..0....0..4..0..0....0..1..1..1....0..2..0..1 %e A221886 ..0..4..1..0....0..0..2..0....0..0..0..1....0..1..1..3....1..2..0..2 %e A221886 ..1..0..1..0....1..1..2..2....2..1..2..2....3..1..0..0....0..2..1..1 %Y A221886 Column 1 is A002478 %K A221886 nonn,tabl %O A221886 1,2 %A A221886 _R. H. Hardin_ Jan 30 2013