A180058 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A180058

Smallest number occurring in exactly n rows of Pascal's triangle.

4

2, 6, 120, 3003

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

A059233(a(n)) = n and A059233(m) < n for m < a(n).

LINKS

Table of n, a(n) for n=1..4.

Wikipedia, Singmaster's conjecture

Index entries for triangles and arrays related to Pascal's triangle

EXAMPLE

. n A180058 referred equal binomial coefficients (A007318) A059233

. - ------- ---------------------------------------------- -------

. 1 2 C (2, 1) 1

. 2 6 C (4, 2) C (6, 1) 2

. 3 120 C (10, 3) C (16, 2) C (120, 1) 3

. 4 3003 C (14, 6) C (15, 5) C (78, 2) C (3003, 1) 4 .

PROG

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (fromJust)

a180058 = (+ 2) . fromJust . (`elemIndex` a059233_list)

CROSSREFS

Cf. A185024, A182237, A098565, A003015, A003016.

Sequence in context: A376378 A212158 A058251 * A376866 A264470 A039716

Adjacent sequences: A180055 A180056 A180057 * A180059 A180060 A180061

KEYWORD

nonn,more

AUTHOR

Reinhard Zumkeller, Dec 24 2012

STATUS

approved