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 A202715 #7 Jul 22 2025 16:47:08 %S A202715 38,624,4740,23036,83994,250668,645968,1487832,3136542,6155240, %T A202715 11386212,20043612,33825674,55046532,86791272,133093760,199141470, %U A202715 291506184,418405556,589993572,818685762,1119516332,1510533960,2013232464 %N A202715 Number of 3X3 0..n arrays with row sums equal and no column sum equal to the previous. %C A202715 Row 3 of A202714 %H A202715 R. H. Hardin, <a href="/A202715/b202715.txt">Table of n, a(n) for n = 1..49</a> %e A202715 Some solutions for n=5 %e A202715 ..1..5..1....1..0..2....1..2..5....3..3..0....5..2..3....5..1..1....0..2..2 %e A202715 ..1..3..3....1..1..1....4..1..3....3..1..2....3..5..2....4..0..3....3..1..0 %e A202715 ..4..2..1....3..0..0....4..0..4....4..1..1....1..4..5....1..5..1....1..2..1 %K A202715 nonn %O A202715 1,1 %A A202715 _R. H. Hardin_ Dec 23 2011