The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A157000

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
newer changes | Showing entries 11-20 | older changes

A157000

Triangle T(n,k) = (n/k)*binomial(n-k-1, k-1) read by rows.
(history; published version)

#15 by Michel Marcus at Sun Mar 02 11:47:11 EST 2014

COMMENTS

T(n,k) is the number of ways to select k knights from a round table of n nights, knights, no two adjacent. - Bert Seghers, Mar 2014

EXTENSIONS

Offset 2, keyword:tabf, more terms by the Assoc. Eds. of the OEIS, Nov 01 2010.

STATUS

proposed

editing

#14 by Bert Seghers at Sun Mar 02 10:52:13 EST 2014

STATUS

editing

proposed

#13 by Bert Seghers at Sun Mar 02 10:49:52 EST 2014

COMMENTS

T(n,k) is the number of ways to select k knights from a round table of n nights, no two adjacent. - Bert Seghers, Mar 2014

FORMULA

T(n,k) = binomial(n-k,k) + binomial(n-k-1,k-1)

STATUS

approved

editing

#12 by Charles R Greathouse IV at Mon May 13 01:49:06 EDT 2013

PROG

(PARI) a(n, k)=n*binomial(n-k-1, k-1)/k \\ _Charles R Greathouse IV, _, Jul 10 2011

Discussion

Mon May 13

01:49

OEIS Server: https://oeis.org/edit/global/1914

#11 by Joerg Arndt at Sun Mar 17 05:04:43 EDT 2013

STATUS

proposed

approved

#10 by Philippe Deléham at Sun Mar 17 00:47:34 EDT 2013

STATUS

editing

proposed

#9 by Philippe Deléham at Sun Mar 17 00:47:28 EDT 2013

COMMENTS

Triangle A034807 (coefficients of Lucas polynomials) with the first column omitted. - Philippe Deléham, Mar 17 2013

STATUS

approved

editing

#8 by T. D. Noe at Mon Mar 04 17:35:18 EST 2013

STATUS

proposed

approved

#7 by Ira M. Gessel at Mon Mar 04 14:19:56 EST 2013

STATUS

editing

proposed

#6 by Ira M. Gessel at Mon Mar 04 14:19:37 EST 2013

CROSSREFS

Cf. A132460, A113279, A082985, A029635.

STATUS

approved

editing