|
gptkbp:instanceOf
|
integer sequence
|
|
gptkbp:author
|
gptkb:N._J._A._Sloane
|
|
gptkbp:citation
|
gptkb:OEIS_A000984
gptkb:OEIS_A001047
OEIS A000110
OEIS A000245
OEIS A001190
OEIS A002190
OEIS A007317
OEIS A014137
OEIS A099950
https://oeis.org/A000108
|
|
gptkbp:eighth_term
|
429
|
|
gptkbp:eleventh_term
|
16796
|
|
gptkbp:fifteenth_term
|
2674440
|
|
gptkbp:fifthBook
|
14
|
|
gptkbp:first_terms
|
1
|
|
gptkbp:form
|
C(n) = (2n)! / ((n+1)! n!)
|
|
gptkbp:fourteenth_term
|
742900
|
|
gptkbp:fourthPlace
|
5
|
|
gptkbp:generating_function
|
(1 - sqrt(1-4x)) / (2x)
|
|
gptkbp:hasKeyword
|
easy
nice
core
full
nonn
fini
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
OEIS A000108
|
|
gptkbp:name
|
gptkb:Catalan_numbers
|
|
gptkbp:ninth_term
|
1430
|
|
gptkbp:OEIS
|
A000108
|
|
gptkbp:recurrence
|
C(0) = 1, C(n+1) = sum_{i=0}^{n} C(i) C(n-i)
|
|
gptkbp:relatedTo
|
gptkb:Dyck_paths
parenthesizations
binary trees
non-crossing partitions
polygon triangulations
stack-sortable permutations
|
|
gptkbp:sequence
|
combinatorial
|
|
gptkbp:seventhBook
|
132
|
|
gptkbp:sixthBook
|
42
|
|
gptkbp:tenth_term
|
4862
|
|
gptkbp:thirdPlace
|
2
|
|
gptkbp:thirteenth_term
|
208012
|
|
gptkbp:twelfth_term
|
58786
|
|
gptkbp:bfsParent
|
gptkb:OEIS_A001349
|
|
gptkbp:bfsLayer
|
7
|