cp's OEIS Frontend

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.

A049639 Array T read by diagonals; T(i,j) = number of lines passing through (i,j) and at least two other lattice points (h,k) satisfying 0<=h<=i, 0<=k<=j.

This page as a plain text file.
%I A049639 #15 Aug 14 2021 15:34:45
%S A049639 0,0,0,1,0,1,1,1,1,1,1,1,3,1,1,1,1,3,3,1,1,1,1,4,3,4,1,1,1,1,4,4,4,4,
%T A049639 1,1,1,1,5,4,5,4,5,1,1,1,1,5,5,5,5,5,5,1,1,1,1,6,5,7,5,7,5,6,1,1,1,1,
%U A049639 6,6,7,7,7,7,6,6,1,1,1,1,7,6,8,7,9,7,8,6,7,1,1
%N A049639 Array T read by diagonals; T(i,j) = number of lines passing through (i,j) and at least two other lattice points (h,k) satisfying 0<=h<=i, 0<=k<=j.
%C A049639 It appears that T(n, k) = A049687(n/2, k/2).
%H A049639 G. C. Greubel, <a href="/A049639/b049639.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%e A049639 Antidiagonals (each starting on row 1):
%e A049639   0.
%e A049639   0, 0.
%e A049639   1, 0, 1.
%e A049639   1, 1, 1, 1.
%e A049639   1, 1, 3, 1, 1.
%e A049639   1, 1, 3, 3, 1, 1.
%e A049639   1, 1, 4, 3, 4, 1, 1.
%e A049639   ...
%t A049639 a[0|1, 0|1] = 0; a[0|1, _] = a[_, 0|1] = 1; a[i_, j_] := Module[{slopes, cnt}, slopes = Union @ Flatten @ Table[(k-j)/(h-i), {h, 0, i-1}, {k, 0, j - 1}]; cnt[slope_] := Count[Flatten[Table[{h, k}, {h, 0, i-1}, {k, 0, j - 1}], 1], {h_, k_} /; (k-j)/(h-i) == slope]; Count[cnt /@ slopes, c_ /; c >= 2] + 2]; Table[a[i-j, j], {i, 0, 12}, {j, 0, i}] // Flatten (* _Jean-François Alcover_, Apr 03 2017 *)
%Y A049639 Cf. A049687.
%K A049639 nonn,tabl
%O A049639 0,13
%A A049639 _Clark Kimberling_