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 A240048 #7 Jun 02 2025 09:39:35 %S A240048 4,10,26,72,174,597,1187,3115,7269,16520,39181,89951,210684,483773, %T A240048 1131924,2616441,6047969,14112456,32543109,75591535,175328537, %U A240048 405822918,941534652,2181820138,5057085795,11720944941,27171466826,62973901722 %N A240048 Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. %C A240048 Row 3 of A240046 %H A240048 R. H. Hardin, <a href="/A240048/b240048.txt">Table of n, a(n) for n = 1..200</a> %H A240048 R. H. Hardin, <a href="/A240048/a240048.txt">Empirical recurrence of order 76</a> %F A240048 Empirical recurrence of order 76 (see link above) %e A240048 Some solutions for n=3 %e A240048 ..2..3..2....2..3..3....3..2..2....3..2..2....3..2..2....2..3..2....2..3..3 %e A240048 ..1..0..0....3..1..2....1..0..0....2..0..0....2..0..3....1..0..0....3..1..2 %e A240048 ..2..0..0....3..2..2....2..0..0....2..0..0....2..1..0....1..2..0....3..1..2 %K A240048 nonn %O A240048 1,1 %A A240048 _R. H. Hardin_, Mar 31 2014