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 A229407 #6 Jul 23 2025 05:43:12 %S A229407 57,1756,53538,1629298,49788258,1519840402,46408035676,1416912709750, %T A229407 43262165219520,1320895600914374,40330198228444030, %U A229407 1231378827675817778,37596999339380782420,1147927946466853457658,35049037211821475282406 %N A229407 Number of nX3 0..3 arrays avoiding 11 horizontally, 22 vertically, 33 antidiagonally and 00 diagonally. %C A229407 Column 3 of A229412 %H A229407 R. H. Hardin, <a href="/A229407/b229407.txt">Table of n, a(n) for n = 1..210</a> %F A229407 Empirical: a(n) = 18*a(n-1) +376*a(n-2) +224*a(n-3) -1664*a(n-4) +36983*a(n-5) -181958*a(n-6) +100599*a(n-7) +484260*a(n-8) -503501*a(n-9) -354823*a(n-10) +399643*a(n-11) +243696*a(n-12) +20412*a(n-13) %e A229407 Some solutions for n=3 %e A229407 ..1..0..1....0..0..1....3..2..2....2..0..0....1..3..0....3..1..2....3..2..0 %e A229407 ..3..3..3....0..2..1....0..3..1....1..3..1....1..3..0....1..0..0....2..0..2 %e A229407 ..0..2..0....2..3..2....2..3..3....0..3..1....0..0..2....1..0..1....3..3..1 %K A229407 nonn %O A229407 1,1 %A A229407 _R. H. Hardin_ Sep 22 2013