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.

A087644 Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.

This page as a plain text file.
%I A087644 #12 Dec 06 2014 13:23:43
%S A087644 1,1,3,1,6,12,1,10,36,60,1,15,86,240,360,1,21,176,756,1800,2520,1,28,
%T A087644 323,1988,7092,15120,20160,1,36,547,4572,22996,71856,141120,181440,1,
%U A087644 45,871,9495,64144,278820,787824,1451520,1814400,1,55,1321,18205,159094
%N A087644 Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.
%C A087644 Equals A071223/2. See that entry for further information.
%H A087644 T. M. Cover, <a href="http://www.jstor.org/stable/2946294">The number of linearly inducible orderings of points in d-space</a>, SIAM J. Applied Math., 15 (1967), 434-439.
%p A087644 T:=proc(n,k) if k>=n then 0 elif k=1 and n>=2 then 1 elif n=2 and k>=1 then 1 elif k=n-1 then n!/2 else T(n-1,k)+(n-1)*T(n-1,k-1) fi end:seq(seq(T(n,k),k=1..n-1),n=2..12);
%Y A087644 Cf. A071223.
%K A087644 nonn,tabl,easy
%O A087644 2,3
%A A087644 _N. J. A. Sloane_, Oct 26 2003
%E A087644 More terms from _Emeric Deutsch_, May 24 2004