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 A265118 #10 Mar 23 2017 14:41:38 %S A265118 0,0,8,6,10,26,42,70,150,282,506,1002,1950,3670,7126,13926,26826, %T A265118 52082,101802,198146,386238,755790,1478302,2892442,5670210,11122230, %U A265118 21823494,42863862,84247842,165655146,325927242,641635110,1263690038,2489962938 %N A265118 Number of 3Xn arrays containing n copies of 0..3-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums. %C A265118 Row 3 of A265117. %H A265118 R. H. Hardin, <a href="/A265118/b265118.txt">Table of n, a(n) for n = 1..210</a> %F A265118 G.f.: 2*(r^2-r+1)/sqrt((r-1)*(2*r-1)*(2*r^2+r+1))+2*(r^3-r^2-1) -_Stefan Hollos_, Mar 23 2017 %e A265118 Some solutions for n=9 %e A265118 ..0..1..0..2..1..2..1..0..2....2..1..0..1..2..1..0..2..0 %e A265118 ..2..2..1..0..0..0..2..1..1....0..2..2..0..0..2..1..1..1 %e A265118 ..1..0..2..1..2..1..0..2..0....1..0..1..2..1..0..2..0..2 %Y A265118 Cf. A265117. %K A265118 nonn %O A265118 1,3 %A A265118 _R. H. Hardin_, Dec 01 2015