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 A119439 #4 Mar 31 2012 13:21:31 %S A119439 1,1,1,1,4,6,1,9,12,8,1,16,48,4,10,1,25,108,16,4,12,1,36,248,36,4,4, %T A119439 14,1,49,428,64,20,4,4,16,1,64,764,100,44,4,4,4,18,1,81,1196,204,36, %U A119439 24,4,4,4,20,1,100,1900,252,64,52,4,4,4,4,22,1,121,2668,396,124,40,28,4,4,4,4 %N A119439 Triangle T(n,k) = number of sets of m points determined by the intersection of a line with an n X n grid of points. %C A119439 Each singleton point is determined by all but finitely many of the family of lines passing through that point and the empty set is determined by any randomly positioned line. %F A119439 T(n,0) = 1, T(n,1) = n^2, T(n,k) = A119437(n,k) for k>1. %e A119439 The table starts: %e A119439 1, %e A119439 1,1, %e A119439 1,4,6, %e A119439 1,9,12,8, %e A119439 1,16,48,4,10, %Y A119439 Row sums A119438; columns A000290, A018809-A018817. See A119437 for another version. %K A119439 nonn,tabl %O A119439 0,5 %A A119439 _Franklin T. Adams-Watters_, May 19 2006