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 A262465 #6 Sep 05 2025 13:12:35 %S A262465 1,3,36,457,30229,8080915,15659602612 %N A262465 Number of (n+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 A262465 Diagonal of A262472. %e A262465 Some solutions for n=4 %e A262465 ..1..0..0..1..0....0..1..0..0..1....0..1..1..1..1....1..1..0..0..0 %e A262465 ..1..0..0..1..0....0..1..0..0..1....1..1..0..1..1....0..0..1..1..0 %e A262465 ..1..0..0..1..0....1..1..0..1..1....0..0..1..1..0....1..1..1..1..0 %e A262465 ..1..0..0..1..0....0..1..0..0..1....1..0..0..1..0....0..0..1..1..0 %e A262465 ..0..0..0..0..0....1..0..0..1..0....0..1..0..0..1....0..0..1..1..0 %Y A262465 Cf. A262472. %K A262465 nonn,changed %O A262465 1,2 %A A262465 _R. H. Hardin_, Sep 23 2015