The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A026670

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

A026670

Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0; for n >= 1, T(n,1) = T(n,n-1) = n+1; for n >= 2, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and k = n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).
(history; published version)

#26 by Alois P. Heinz at Fri Oct 25 16:55:38 EDT 2019

STATUS

proposed

approved

#25 by Sean A. Irvine at Fri Oct 25 15:46:13 EDT 2019

STATUS

editing

proposed

#24 by Sean A. Irvine at Fri Oct 25 15:44:19 EDT 2019

OFFSET

1,0,5

EXTENSIONS

Offset corrected by R. J. Mathar and Sean A. Irvine, Oct 25 2019

STATUS

approved

editing

Discussion

Fri Oct 25

15:46

Sean A. Irvine: Dependencies already seem to be assuming this offset (which is also consistent with the here Example for T(4,2).

#23 by Alois P. Heinz at Wed Oct 09 20:49:34 EDT 2019

STATUS

editing

approved

#22 by Alois P. Heinz at Wed Oct 09 20:49:27 EDT 2019

EXTENSIONS

Name Typo in name corrected by Sean A. Irvine, Oct 09 2019

STATUS

proposed

editing

#21 by Sean A. Irvine at Wed Oct 09 17:18:28 EDT 2019

STATUS

editing

proposed

#20 by Sean A. Irvine at Wed Oct 09 17:18:20 EDT 2019

NAME

Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0; for n >= 1, T(n,1) = T(n,n-1) = n-+1; for n >= 2, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and k = n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).

EXTENSIONS

Name corrected by Sean A. Irvine, Oct 09 2019

STATUS

approved

editing

#19 by Bruno Berselli at Fri Dec 11 04:09:13 EST 2015

STATUS

proposed

approved

#18 by Michel Marcus at Fri Dec 11 03:42:13 EST 2015

STATUS

editing

proposed

#17 by Michel Marcus at Fri Dec 11 03:42:03 EST 2015

EXTENSIONS

Formula corrected by David Perkinson (davidp(AT)reed.edu), Sep 19 2001 and also by _Rob Arthan, _, Jan 16 2003

STATUS

proposed

editing