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 A262474 #4 Sep 23 2015 18:53:48 %S A262474 7,17,115,457,3055,16081,107731,655001,4427407,28848817,196901395, %T A262474 1326556777,9126593455,62528586641,432702173011,2991144099001, %U A262474 20781922758607,144379920476017,1005798678435475,7008103279484297 %N A262474 Number of (4+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits. %C A262474 Row 4 of A262472. %H A262474 R. H. Hardin, <a href="/A262474/b262474.txt">Table of n, a(n) for n = 1..210</a> %F A262474 Empirical: a(n) = 7*a(n-1) +75*a(n-2) -525*a(n-3) -2034*a(n-4) +14238*a(n-5) +25010*a(n-6) -175070*a(n-7) -141969*a(n-8) +993783*a(n-9) +333315*a(n-10) -2333205*a(n-11) -214396*a(n-12) +1500772*a(n-13) %e A262474 Some solutions for n=4 %e A262474 ..0..1..0..0..1....0..0..0..0..0....1..1..0..0..0....0..1..1..0..0 %e A262474 ..1..1..1..1..0....0..0..0..0..0....1..0..1..0..1....0..1..1..1..1 %e A262474 ..0..1..1..1..1....0..0..0..1..1....1..1..0..0..0....0..1..1..1..1 %e A262474 ..1..1..1..1..0....0..0..0..0..0....1..0..1..0..1....0..1..1..1..1 %e A262474 ..0..0..1..1..0....0..0..0..1..1....0..0..0..0..0....0..0..0..1..1 %Y A262474 Cf. A262472. %K A262474 nonn %O A262474 1,1 %A A262474 _R. H. Hardin_, Sep 23 2015