The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A051125

Table T(n,k) = max{n,k} read by antidiagonals (n >= 1, k >= 1).
(history; published version)

#42 by Jon E. Schoenfield at Thu Feb 17 01:14:57 EST 2022

STATUS

proposed

approved

#41 by Jon E. Schoenfield at Thu Feb 17 00:35:27 EST 2022

STATUS

editing

proposed

#40 by Jon E. Schoenfield at Thu Feb 17 00:35:26 EST 2022

EXAMPLE

1 , 2 , 3 , 4 , 5, ...

2 , 2 , 3 , 4 , 5, ...

3 , 3 , 3 , 4 , 5, ...

4 , 4 , 4 , 4 , 5, ...

...

PROG

(MAGMAMagma) [Max(n-k+1, k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 23 2019

STATUS

approved

editing

#39 by Susanna Cuyler at Tue Jul 23 17:32:46 EDT 2019

STATUS

proposed

approved

#38 by G. C. Greubel at Tue Jul 23 16:23:47 EDT 2019

STATUS

editing

proposed

#37 by G. C. Greubel at Tue Jul 23 16:23:11 EDT 2019

MATHEMATICA

Flatten[Table[Max[n - k + 1, k], {n, 13}, {k, n, 1, -1}]] (* Alonso del Arte, Nov 17 2011 *)

PROG

(MAGMA) [Max(n-k+1, k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 23 2019

(Sage) [[max(n-k+1, k) for k in (1..n)] for n in (1..15)] # G. C. Greubel, Jul 23 2019

(GAP) Flat(List([1..15], n-> List([1..n], k-> Maximum(n-k+1, k) ))); # G. C. Greubel, Jul 23 2019

CROSSREFS

Cf. A003984, A003056, A003983, A003984, A004197, A003056.

Equals A003984(n) + 1.

STATUS

approved

editing

#36 by Jon E. Schoenfield at Fri Jun 23 22:59:32 EDT 2017

STATUS

editing

approved

#35 by Jon E. Schoenfield at Fri Jun 23 22:59:28 EDT 2017

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#34 by Charles R Greathouse IV at Tue Feb 07 22:54:44 EST 2017

STATUS

editing

approved

#33 by Charles R Greathouse IV at Tue Feb 07 22:54:26 EST 2017

PROG

(PARI) T(n, k) = max(n, k) \\ Charles R Greathouse IV, Feb 07 2017

CROSSREFS

A003984(n) + 1.

STATUS

approved

editing