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 A240286 #6 Jun 02 2025 09:46:48 %S A240286 3,19,80,570,2574,20764,97348,802835,3797188,31467286,149131302, %T A240286 1237084277,5865347475,48665192186,230756350987,1914691579848, %U A240286 9079103009997,75334276334445,357222415759008,2964076274068268 %N A240286 Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. %C A240286 Row 3 of A240284 %H A240286 R. H. Hardin, <a href="/A240286/b240286.txt">Table of n, a(n) for n = 1..210</a> %F A240286 Empirical: a(n) = 63*a(n-2) -1109*a(n-4) +7143*a(n-6) -395*a(n-8) -201246*a(n-10) +762860*a(n-12) +347011*a(n-14) -7366154*a(n-16) +11744674*a(n-18) +3758987*a(n-20) +10095295*a(n-22) -126415852*a(n-24) +204390541*a(n-26) -65238786*a(n-28) -59211883*a(n-30) -114625640*a(n-32) +381020006*a(n-34) -342073760*a(n-36) +16725276*a(n-38) +181283664*a(n-40) -110895680*a(n-42) +16492080*a(n-44) +1175136*a(n-46) +390464*a(n-48) for n>51 %e A240286 Some solutions for n=4 %e A240286 ..3..3..1..3....3..1..3..1....3..3..1..1....3..1..3..1....3..3..1..3 %e A240286 ..2..0..1..3....3..2..3..2....2..0..0..2....3..1..2..0....3..2..0..3 %e A240286 ..2..0..1..2....2..2..3..2....2..0..0..0....3..1..2..0....3..1..2..2 %K A240286 nonn %O A240286 1,1 %A A240286 _R. H. Hardin_, Apr 03 2014