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 A222277 #7 Mar 14 2018 15:16:44 %S A222277 125,46305,17153945,6354787485,2354171487645,872117822449905, %T A222277 323081602357856985,119687637492011211885,44339047670574481807485, %U A222277 16425682631297501047982145,6084998755694142903356375385 %N A222277 Number of n X 4 0..5 arrays with no entry increasing mod 6 by 5 rightwards or downwards, starting with upper left zero. %C A222277 Column 4 of A222281. %H A222277 R. H. Hardin, <a href="/A222277/b222277.txt">Table of n, a(n) for n = 1..210</a> %F A222277 Empirical: a(n) = 399*a(n-1) - 10749*a(n-2) + 64767*a(n-3). %F A222277 Empirical g.f.: 5*x*(25 - 714*x + 4375*x^2) / (1 - 399*x + 10749*x^2 - 64767*x^3). - _Colin Barker_, Mar 14 2018 %e A222277 Some solutions for n=3: %e A222277 ..0..0..0..0....0..0..0..0....0..3..0..0....0..0..0..0....0..0..0..0 %e A222277 ..4..1..3..0....0..0..3..0....2..0..0..2....1..3..0..2....2..0..0..0 %e A222277 ..2..3..4..1....4..1..1..3....0..2..2..0....2..5..1..5....3..4..0..2 %Y A222277 Cf. A222281. %K A222277 nonn %O A222277 1,1 %A A222277 _R. H. Hardin_, Feb 14 2013