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 A252870 #9 Nov 22 2015 13:19:33 %S A252870 0,1,8,26,61,120,211,343,526,771,1090,1496,2003,2626,3381,4285,5356, %T A252870 6613,8076,9766,11705,13916,16423,19251,22426,25975,29926,34308,39151, %U A252870 44486,50345,56761,63768,71401,79696,88690,98421,108928,120251,132431,145510 %N A252870 Number of n X 2 nonnegative integer arrays with upper left 0 and lower right n+2-4 and value increasing by 0 or 1 with every step right or down. %C A252870 Column 2 of A252876. %H A252870 R. H. Hardin, <a href="/A252870/b252870.txt">Table of n, a(n) for n = 1..210</a> %F A252870 Empirical: a(n) = (1/24)*n^4 + (5/12)*n^3 - (13/24)*n^2 - (11/12)*n + 1. %F A252870 Empirical: G.f.: -x^2*(1+3*x-4*x^2+x^3) / (x-1)^5. - _R. J. Mathar_, Nov 21 2015 %e A252870 All solutions for n=3: %e A252870 ..0..0....0..0....0..0....0..1....0..1....0..0....0..1....0..0 %e A252870 ..0..0....0..0....0..1....1..1....0..1....0..1....0..1....1..1 %e A252870 ..0..1....1..1....1..1....1..1....1..1....0..1....0..1....1..1 %K A252870 nonn %O A252870 1,3 %A A252870 _R. H. Hardin_, Dec 24 2014