login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180058 Smallest number occuring in exactly n rows of Pascal's triangle. 3
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: A075391 A212158 A058251 * A264470 A039716 A164955

Adjacent sequences:  A180055 A180056 A180057 * A180059 A180060 A180061

KEYWORD

nonn,more

AUTHOR

Reinhard Zumkeller, Dec 24 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 22 15:27 EST 2017. Contains 295089 sequences.