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 A262424 #4 Sep 22 2015 09:36:53 %S A262424 42,144,10206,200880,9401742,326005344,14036526126,562188062160, %T A262424 23753751161742,985963486014144,41471657300369646,1736701374341409840, %U A262424 72968249610859102542,3062420548152290816544,128633450602627230830766 %N A262424 Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. %C A262424 Row 5 of A262420. %H A262424 R. H. Hardin, <a href="/A262424/b262424.txt">Table of n, a(n) for n = 1..210</a> %F A262424 Empirical: a(n) = 42*a(n-1) +711*a(n-2) -29862*a(n-3) -141183*a(n-4) +5929686*a(n-5) +10349613*a(n-6) -434683746*a(n-7) -267400116*a(n-8) +11230804872*a(n-9) +1666598976*a(n-10) -69997156992*a(n-11) %e A262424 Some solutions for n=3 %e A262424 ..0..0..0..0....0..0..1..1....1..1..0..0....0..1..1..0....1..1..1..1 %e A262424 ..0..1..1..0....1..1..0..0....0..0..0..0....1..0..0..1....0..0..0..0 %e A262424 ..1..1..0..0....0..0..1..1....0..0..0..0....0..1..1..0....1..1..0..0 %e A262424 ..0..1..1..0....0..0..1..1....1..0..0..1....1..1..0..0....1..1..0..0 %e A262424 ..1..0..0..1....1..1..0..0....0..1..1..0....0..0..0..0....1..1..1..1 %e A262424 ..0..0..0..0....1..1..0..0....1..0..0..1....0..0..1..1....1..1..0..0 %Y A262424 Cf. A262420. %K A262424 nonn %O A262424 1,1 %A A262424 _R. H. Hardin_, Sep 22 2015