Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051125
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051125 Table T(n,k) = max{n,k} read by antidiagonals (n >= 1, k >= 1). +0
2
1, 2, 2, 3, 2, 3, 4, 3, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 4, 5, 6, 7, 6, 5, 4, 5, 6, 7, 8, 7, 6, 5, 5, 6, 7, 8, 9, 8, 7, 6, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 6, 7, 8, 9, 10, 11, 10, 9, 8, 7, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 7, 7, 8, 9, 10, 11, 12, 13, 12, 11, 10, 9, 8, 7, 8, 9, 10, 11, 12, 13, 14, 13 (list; table; graph; listen)
OFFSET

1,2

EXAMPLE

Table begins

1 2 3 4 5...

2 2 3 4 5...

3 3 3 4 5...

4 4 4 4 5...

CROSSREFS

Cf. A003984, A003983, A004197.

A003984(n) + 1.

Sequence in context: A070081 A034883 A071647 this_sequence A131830 A147952 A091316

Adjacent sequences: A051122 A051123 A051124 this_sequence A051126 A051127 A051128

KEYWORD

nonn,tabl,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Robert Lozyniak (11(AT)onna.com)

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research